| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US6880148B1 Filed: 2000-07-18 Issued: 2005-04-12 Patent Holder: (Original Assignee) Agilent Technologies Inc (Current Assignee) Agilent Technologies Inc Inventor(s): Darvin Dale Raph, Thomas Robert Fay Title: Active data type variable for use in software routines that facilitates customization of software routines and efficient triggering of variable processing |
| [FEATURE ID: 1] method | procedure, means, program, device, step, system, process | [FEATURE ID: 1] routine, computer program apparatus, method |
| [TRANSITIVE ID: 2] querying, accessing, executing, transformation instructions | processing, storing, using, reading, loading, implementing, execution | [TRANSITIVE ID: 2] use, comprising, setting |
| [FEATURE ID: 3] database, tree | file, structure, table, message, data, type, form | [FEATURE ID: 3] computer readable medium, symbol, string format |
| [TRANSITIVE ID: 4] comprising, storing, including | representing, identifying, of, for, having, using, with | [TRANSITIVE ID: 4] defining, enabling |
| [FEATURE ID: 5] instructions, physical memory devices, content, electronic content, binary digital signals, states, trees | information, elements, data, values, objects, components, attributes | [FEATURE ID: 5] numerical values, logic |
| [FEATURE ID: 6] execution, having | executing, analysis, performing, the, computing, implementation, access | [FEATURE ID: 6] processing |
| [TRANSITIVE ID: 7] accessed, executed | loaded, processed, applied, selected, identified, requested, taken | [TRANSITIVE ID: 7] executed |
| [FEATURE ID: 8] signal values, numerical signal values, signals, probe numerical signal values | information, parameters, events, results, data, instructions, messages | [FEATURE ID: 8] value processing results, set value |
| [FEATURE ID: 9] form, numerical signal value | structure, definition, configuration, output, location, value, operation | [FEATURE ID: 9] integrity, electrical circuit, data type, range, type, format |
| [FEATURE ID: 10] query, correspondence | reference, handle, property, symbol, value, key, function | [FEATURE ID: 10] name, identify, string data type instance |
| [FEATURE ID: 11] claim | item, figure, claim of, requirement, preceding claim, embodiment, clause | [FEATURE ID: 11] claim |
| [FEATURE ID: 12] depth | count, number, value, maximum | [FEATURE ID: 12] size |
| [FEATURE ID: 13] presence | state, status, version, location | [FEATURE ID: 13] numerical value |
| [FEATURE ID: 14] probe numerical signal value | value, name, type, symbol, character, string, code | [FEATURE ID: 14] data type further, parameter, format operation, variable further |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion thereof , comprising [TRANSITIVE ID: 4] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 5] from one or more physical memory devices [FEATURE ID: 5] for execution [FEATURE ID: 6] by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed [TRANSITIVE ID: 7] from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 4] , in at least one of the physical memory devices , signal values [FEATURE ID: 8] , including [TRANSITIVE ID: 4] numerical signal values [FEATURE ID: 8] , resulting from having [TRANSITIVE ID: 6] executed [TRANSITIVE ID: 7] the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 9] of a hierarchically structured tree [FEATURE ID: 3] via one or more numerical signal values corresponding to content [FEATURE ID: 5] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 2] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 5] including binary digital signals [FEATURE ID: 5] and / or states [FEATURE ID: 5] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 10] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 9] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 11] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 8] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 12] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 8] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 13] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 5] and numerical signal values , and wherein a correspondence [FEATURE ID: 10] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 14] |
1 . A variable tangibly embodied on a computer readable medium [FEATURE ID: 3] , for use [FEATURE ID: 2] in a computer program , the computer program configured to verify the integrity [FEATURE ID: 9] of an electrical circuit [FEATURE ID: 9] , the variable comprising [TRANSITIVE ID: 2] : a data type [FEATURE ID: 9] defining [TRANSITIVE ID: 4] the size [FEATURE ID: 12] , range [FEATURE ID: 9] , and type [FEATURE ID: 9] of numerical values [FEATURE ID: 5] to which the variable is limited ; a name [FEATURE ID: 10] enabling [TRANSITIVE ID: 4] the computer program to identify [TRANSITIVE ID: 10] the variable ; and a numerical value [FEATURE ID: 13] ; wherein the data type further [FEATURE ID: 14] comprises a first algorithm that is automatically executed [TRANSITIVE ID: 7] when a routine [FEATURE ID: 1] of the computer program attempts to access the numerical value of the variable ; and wherein , before the routine accesses the numerical value , the first algorithm begins processing the numerical value for providing an updated numerical value of the variable . 2 . The variable of claim [FEATURE ID: 11] 1 , wherein processing [FEATURE ID: 6] by the first algorithm is suspended until the routine is finished running . 3 . The variable of claim 2 , wherein the data type further comprises : a second algorithm that is automatically executed once the updated numerical value has been set , the second algorithm processing the set value to generate value processing results [FEATURE ID: 8] . 4 . The variable of claim 3 , wherein the setting [FEATURE ID: 2] of the value and the processing of the set value by the second algorithm is delayed until the routine returns , wherein once the routine returns , the second algorithm processes the set value [FEATURE ID: 8] to generate value processing results . 5 . The variable of claim 1 , wherein the data type is a parameter [FEATURE ID: 14] being utilized by the computer program . 6 . The variable of claim 1 , wherein the data type is a symbol [FEATURE ID: 3] being utilized by the computer program . 7 . The variable of claim 1 , wherein the data type is a string format [FEATURE ID: 3] being utilized by the computer program , the string format specifying a format [FEATURE ID: 9] of a string data type instance [FEATURE ID: 10] associated with the string format , the string format including a format operation [FEATURE ID: 14] , the format operation specifying an operation associated with the string data type instance . 8 . A computer program apparatus [FEATURE ID: 1] for verifying the integrity of an electrical circuit , the computer program accessing a variable , the variable comprising a data type defining the size , range , and type of numerical values to which the variable is limited , the variable further [FEATURE ID: 14] comprising a name , enabling the computer program to identify the variable , and a numerical value , the computer program apparatus comprising : logic [FEATURE ID: 5] configured to execute at least one test routine , wherein the data type further comprises a first algorithm that is automatically executed when the at least one test routine attempts to access the numerical value of the variable ; and logic configured to execute the first algorithm before the at least one routine accesses the numerical value , the first algorithm processing the numerical value to provide an updated numerical value of the variable . 9 . The apparatus of claim 8 , wherein , once the first algorithm has determined the updated numerical value , processing by the first algorithm is suspended until the test routine is finished running . 10 . The apparatus of claim 9 , wherein the data type further comprises a second algorithm configured to be automatically executed once the updated numerical value has been set , the second algorithm processing the set value to generate value processing results . 11 . The apparatus of claim 10 , wherein the setting of the value and the processing of the set value by the second algorithm is delayed until the test routine returns , and wherein once the test routine returns , the second algorithm processes the set value to generate value processing results . 12 . A method [FEATURE ID: 1] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US6874005B2 Filed: 2001-12-28 Issued: 2005-03-29 Patent Holder: (Original Assignee) Texas Instruments Inc (Current Assignee) Texas Instruments Inc Inventor(s): Todd D. Fortenberry, Laura K. Harvey Title: Subexpression selection of expression represented in contiguous tokenized polish representation |
| [FEATURE ID: 1] method | device, means, system, program, display, mechanism, function | [FEATURE ID: 1] handheld device, user interface, screen capable |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing, having | using, processing, reading, implementing, providing, receiving, compiling | [TRANSITIVE ID: 2] selecting, comprising, loading |
| [FEATURE ID: 3] database | document, file, memory, table, spreadsheet, server, directory | [FEATURE ID: 3] binary tree, memory display |
| [FEATURE ID: 4] portion | segment, fragment, string, term, component, section, subset | [FEATURE ID: 4] subexpression, operator |
| [TRANSITIVE ID: 5] comprising | including, by, and, of, via, using | [TRANSITIVE ID: 5] having |
| [FEATURE ID: 6] instructions | contents, elements, data, information, items | [FEATURE ID: 6] mathematical expressions |
| [FEATURE ID: 7] signal values, content, binary digital signals, states, partial subtrees, signals, non-terminal nodes, nodes, probe numerical signal values, trees, query fields, hierarchical query fields | elements, parameters, attributes, structures, values, data, keys | [FEATURE ID: 7] selectable subexpressions, algebraic expressions |
| [TRANSITIVE ID: 8] including | optionally, preferably, and, or | [TRANSITIVE ID: 8] further |
| [FEATURE ID: 9] numerical signal values, transformation instructions, node label values | indices, coefficients, parameters, integers, symbols, expressions, values | [FEATURE ID: 9] constants, variables, functions, adjacent operands |
| [TRANSITIVE ID: 10] resulting | provided, generated, formed, created, output | [TRANSITIVE ID: 10] displayed |
| [FEATURE ID: 11] form, presence | appearance, structure, order, context, representation, size, operation | [FEATURE ID: 11] expression string, visual representation |
| [FEATURE ID: 12] tree, depth | root, leaf, hierarchy, list, graph, table, branch | [FEATURE ID: 12] user |
| [FEATURE ID: 13] electronic content | elements, portions, components, values, functions, features, entries | [FEATURE ID: 13] combinations, keys |
| [FEATURE ID: 14] query | selection, pointer, user, command | [FEATURE ID: 14] index |
| [FEATURE ID: 15] numerical signal value | window, computer, keypad, user, display, menu, gui | [FEATURE ID: 15] screen, history display, cursor, selection box |
| [FEATURE ID: 16] claim | section, example, embodiment, item, paragraph, statement, aspect | [FEATURE ID: 16] claim |
| [FEATURE ID: 17] root nodes, probe numerical signal value | tree, name, part, root, structure, branch, signature | [FEATURE ID: 17] visible representation |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 6] from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 7] , including [TRANSITIVE ID: 8] numerical signal values [FEATURE ID: 9] , resulting [TRANSITIVE ID: 10] from having [TRANSITIVE ID: 2] executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 11] of a hierarchically structured tree [FEATURE ID: 12] via one or more numerical signal values corresponding to content [FEATURE ID: 7] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 9] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 13] including binary digital signals [FEATURE ID: 7] and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 14] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 15] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 16] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 7] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 7] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 7] of the hierarchically structured tree , any root nodes [FEATURE ID: 17] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 7] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 12] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 9] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 7] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 11] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 7] and numerical signal values , and wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 17] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 7] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 7] |
1 . An algorithm for a handheld device [FEATURE ID: 1] for selecting [TRANSITIVE ID: 2] a subexpression [FEATURE ID: 4] of a mathematical expression having [TRANSITIVE ID: 5] a visible representation [FEATURE ID: 17] displayed [TRANSITIVE ID: 10] on a screen [FEATURE ID: 15] on the handheld device , the algorithm comprising [TRANSITIVE ID: 2] : selecting an expression string [FEATURE ID: 11] of the handheld device ; converting the string to a contiguous tokenized Polish representation ( CTPR ) of the expression , wherein at least one operator [FEATURE ID: 4] of the CTPR is binary ; and loading [TRANSITIVE ID: 2] the CTPR of the expression into an n - ary tree , wherein the user [FEATURE ID: 12] may navigate within the visible representation of the expression to select a subexpression , wherein the handheld device is adapted to select the subexpression from the n - ary tree . 2 . The algorithm according to claim [FEATURE ID: 16] 1 , further comprising loading the CTPR of the expression into a binary tree [FEATURE ID: 3] , before loading the CTPR of the expression into the n - ary tree . 3 . The algorithm according to claim 1 , wherein the expression comprises “ a + b + c ” , wherein the selectable subexpressions [FEATURE ID: 7] comprise “ a + b ” and “ b + c ” . 4 . The algorithm according to claim 3 , wherein a , b and c comprise constants [FEATURE ID: 9] , variables [FEATURE ID: 9] , functions [FEATURE ID: 9] , algebraic expressions [FEATURE ID: 7] , or combinations [FEATURE ID: 13] thereof . 5 . The algorithm according to claim 1 , further comprising using the selected subexpression in another expression . 6 . The algorithm according to claim 1 , further comprising : transforming the selected subexpression ; and inputting the transformed subexpression into the expression . 7 . The algorithm according to claim 1 , wherein selecting an expression string comprises selecting an expression string from a memory display [FEATURE ID: 3] or selecting a expression string received from a user . 8 . The algorithm according to claim 1 , wherein the handheld device selects the subexpression using at least one index [FEATURE ID: 14] . 9 . The algorithm according to claim 1 , wherein the handheld device comprises a history display [FEATURE ID: 15] and a cursor [FEATURE ID: 15] , further [FEATURE ID: 8] comprising a user interface [FEATURE ID: 1] adapted to allow a user to : scroll the cursor to a mathematical expression in the history display to select the expression string ; activate a subexpression mode having a selection box [FEATURE ID: 15] ; and size and position the selection box over a subexpression . 10 . The algorithm according to claim 1 , wherein any adjacent operands [FEATURE ID: 9] are selectable . 11 . The algorithm according to claim 1 , wherein the n - ary tree mimics the visual representation [FEATURE ID: 11] of the expression . 12 . A handheld device comprising : a screen capable [FEATURE ID: 1] of displaying mathematical expressions [FEATURE ID: 6] in a visible representation , the screen including a cursor ; a key panel having keys [FEATURE ID: 13] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050065965A1 Filed: 2003-09-19 Issued: 2005-03-24 Patent Holder: (Original Assignee) JPMorgan Chase Bank NA (Current Assignee) JPMorgan Chase Bank NA Inventor(s): David Ziemann, John Samuel Title: Navigation of tree data structures |
| [FEATURE ID: 1] method | dynamic method, methodology, data method, automated method, programmatic method, computer method, system | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] querying, accessing, executing | using, processing, reading, storing, analyzing, indexing, implementing | [TRANSITIVE ID: 2] navigating, identifying |
| [FEATURE ID: 3] database | memory, user, query, relational, system, library, data | [FEATURE ID: 3] computer, query tree |
| [FEATURE ID: 4] portion | representation, location, partition, segment, subset, section | [FEATURE ID: 4] select node |
| [TRANSITIVE ID: 5] comprising | including, performing, implementing, involves, having, compromising, of | [TRANSITIVE ID: 5] comprising |
| [TRANSITIVE ID: 6] storing | creating, maintaining, identifying, placing, holding, retaining, providing | [TRANSITIVE ID: 6] making |
| [FEATURE ID: 7] signal values, numerical signal values, electronic content, states, signals, non-terminal nodes, nodes, node label values, probe numerical signal values, trees, hierarchical query fields | attributes, information, elements, values, entries, variables, parameters | [FEATURE ID: 7] tree data structures, data, available tree structures |
| [FEATURE ID: 8] tree, probe numerical signal value | root, leaf, forest, key, table, branch, node | [FEATURE ID: 8] tree |
| [FEATURE ID: 9] content | the, points, structures, elements, keys, values | [FEATURE ID: 9] nodes |
| [FEATURE ID: 10] numerical signal value | gui, computer, user, display, terminal, device, screen | [FEATURE ID: 10] computer system, graphical user interface, display device |
| [FEATURE ID: 11] claim | preceding claim, claim of, embodiment, item, paragraph, statement, clause | [FEATURE ID: 11] claim |
| [FEATURE ID: 12] root nodes | nodes, structure, branch, root, reference node, point, member | [FEATURE ID: 12] first node, second node, second matching node, node |
| [FEATURE ID: 13] depth | number, label, zero, count, value | [FEATURE ID: 13] data value |
| [FEATURE ID: 14] target numerical signal value | data value, reference value, value, particular value, given value, first, predetermined value | [FEATURE ID: 14] first value, second value |
| [FEATURE ID: 15] presence | position, complexity, size, level, type | [FEATURE ID: 15] structure |
| [FEATURE ID: 16] query fields | sources, keys, nodes, components, elements | [FEATURE ID: 16] input devices |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 6] , in at least one of the physical memory devices , signal values [FEATURE ID: 7] , including numerical signal values [FEATURE ID: 7] , resulting from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree [FEATURE ID: 8] via one or more numerical signal values corresponding to content [FEATURE ID: 9] within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 7] including binary digital signals and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 10] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 11] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 7] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 7] of the hierarchically structured tree , any root nodes [FEATURE ID: 12] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 7] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 13] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 7] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 7] with at least one target numerical signal value [FEATURE ID: 14] of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 15] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 7] and numerical signal values , and wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 8] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 16] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 7] |
1 . A method [FEATURE ID: 1] for navigating [TRANSITIVE ID: 2] a collection of tree data structures [FEATURE ID: 7] stored in a computer [FEATURE ID: 3] - readable database , the method comprising [TRANSITIVE ID: 5] : constraining a first node [FEATURE ID: 12] of a query tree [FEATURE ID: 3] stored in a computer - readable memory to a first value [FEATURE ID: 14] ; making [TRANSITIVE ID: 6] accessible a first set of nodes [FEATURE ID: 9] of the query tree that are connected to the first node constrained to the first value ; constraining a second node [FEATURE ID: 12] in the first set of nodes to a second value [FEATURE ID: 14] ; identifying [TRANSITIVE ID: 2] a tree [FEATURE ID: 8] in the collection of tree data structures that contains ( 1 ) a first matching node equal in position to the first node and equal to the first value , and ( 2 ) a second matching node equal in position to the second node and equal to the second value ; and accessing data [FEATURE ID: 7] in a select node [FEATURE ID: 4] of the identified tree . 2 . The method of claim [FEATURE ID: 11] 1 wherein the select node is the first matching node , the second matching node [FEATURE ID: 12] , or a node [FEATURE ID: 12] connected to the first or second matching nodes of the identified tree . 3 . The method of claim 1 further comprising : making accessible a second set of nodes of the query tree that are connected to the second node constrained to the second value . 4 . The method of claim 3 wherein the select node is equal in position to the first node of the query tree , the second node of the query tree , or a node in the accessible first or second sets of nodes of the query tree . 5 . The method of claim 1 wherein the first value and the second value are selected from the group consisting of a data value [FEATURE ID: 13] , an unbound special value , and an undefined special value . 6 . The method of claim 1 wherein a structure [FEATURE ID: 15] of the query tree is determined by available tree structures [FEATURE ID: 7] in the collection of tree data structures . 7 . In a computer system [FEATURE ID: 10] having a graphical user interface [FEATURE ID: 10] including a display device [FEATURE ID: 10] and one or more input devices [FEATURE ID: 16] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050065964A1 Filed: 2003-09-19 Issued: 2005-03-24 Patent Holder: (Original Assignee) JPMorgan Chase Bank NA (Current Assignee) JPMorgan Chase Bank NA Inventor(s): David Ziemann, John Samuel Title: Update of a tree-based database |
| [FEATURE ID: 1] method | process, device, mechanism, program, computer, automated method, programmatic method | [FEATURE ID: 1] method, system |
| [TRANSITIVE ID: 2] querying, executing, storing | providing, maintaining, receiving, identifying, processing, building, indexing | [TRANSITIVE ID: 2] updating, generating, storing, applying |
| [FEATURE ID: 3] database, numerical signal value | query, server, memory, table, device, repository, system | [FEATURE ID: 3] computer, query tree, database, database component operative |
| [FEATURE ID: 4] portion | plurality, subset, block, range, source, query, database | [FEATURE ID: 4] set, second set |
| [TRANSITIVE ID: 5] comprising, including | using, containing, of, and, being, as, implementing | [TRANSITIVE ID: 5] comprising, having |
| [TRANSITIVE ID: 6] accessing | transferring, receiving, obtaining, loading, releasing, delivering, updating | [TRANSITIVE ID: 6] deleting, adding |
| [FEATURE ID: 7] instructions, electronic content, binary digital signals, states, non-terminal nodes, nodes, node label values, probe numerical signal values, trees, query fields, hierarchical query fields | values, elements, attributes, structures, information, data, entries | [FEATURE ID: 7] tree data structures |
| [FEATURE ID: 8] signal values, numerical signal values, transformation instructions | data, metadata, keys, information, objects, entries, results | [FEATURE ID: 8] input data, value, query trees, data nodes, query nodes, heterogeneous data |
| [FEATURE ID: 9] tree, probe numerical signal value | key, root, leaf, branch, forest, structure, table | [FEATURE ID: 9] tree data structure, tree consistent, tree |
| [FEATURE ID: 10] content, signals | keys, structures, objects, elements, ones, numbers, bits | [FEATURE ID: 10] nodes, trees consistent, trees |
| [FEATURE ID: 11] claim | paragraph, figure, preceding claim, embodiment, item, clause, the claim | [FEATURE ID: 11] claim |
| [FEATURE ID: 12] partial subtrees | tree, branches, leaves, tree nodes | [FEATURE ID: 12] respective query nodes |
| [FEATURE ID: 13] root nodes, root node | tree, first node, nodes, number, database, root, reference node | [FEATURE ID: 13] collection, data node |
| [FEATURE ID: 14] depth | threshold, number, label, count, value, root | [FEATURE ID: 14] different value |
| [FEATURE ID: 15] presence, correspondence, match | property, similarity, characteristic, difference, condition, value, position | [FEATURE ID: 15] common characteristic, matching node, same value, same relative position |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 6] instructions [FEATURE ID: 7] from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 8] , including [TRANSITIVE ID: 5] numerical signal values [FEATURE ID: 8] , resulting from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree [FEATURE ID: 9] via one or more numerical signal values corresponding to content [FEATURE ID: 10] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 8] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 7] including binary digital signals [FEATURE ID: 7] and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 3] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 11] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 12] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 10] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 7] of the hierarchically structured tree , any root nodes [FEATURE ID: 13] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 7] descending from the root node [FEATURE ID: 13] of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 14] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 7] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 7] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 15] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 7] and numerical signal values , and wherein a correspondence [FEATURE ID: 15] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match [FEATURE ID: 15] between the at least one probe numerical signal value [FEATURE ID: 9] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 7] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 7] |
1 . A method [FEATURE ID: 1] for updating [TRANSITIVE ID: 2] a collection [FEATURE ID: 13] of tree data structures [FEATURE ID: 7] in a computer [FEATURE ID: 3] - readable database with input data [FEATURE ID: 8] , the method comprising [TRANSITIVE ID: 5] : generating [TRANSITIVE ID: 2] a query tree [FEATURE ID: 3] having [TRANSITIVE ID: 5] a tree data structure [FEATURE ID: 9] ; storing [TRANSITIVE ID: 2] the query tree in a computer - readable memory ; applying [TRANSITIVE ID: 2] the query tree to the collection of tree data structures in the database [FEATURE ID: 3] to identify an identified tree consistent [FEATURE ID: 9] with the query tree ; deleting [TRANSITIVE ID: 6] the identified tree [FEATURE ID: 9] from the database ; and adding [TRANSITIVE ID: 6] the input data to the database . 2 . The method of claim [FEATURE ID: 11] 1 wherein generating the query tree comprises applying a mask to the input data to generate a query tree , the mask and the input data each corresponding to a tree data structure . 3 . The method of claim 2 wherein the input data is a unit of input data and the method further comprises : receiving a set [FEATURE ID: 4] of input data comprising a plurality of input data including the unit of input data , each of the set of input data corresponding to a tree data structure ; generating the mask by identifying a common characteristic [FEATURE ID: 15] among the set of input data ; storing the mask in a computer - readable memory ; and adding the set of input data to the database . 4 . The method of claim 3 wherein the common characteristic among the set of input data comprises a matching node [FEATURE ID: 15] in each of the input data , and wherein each matching node has a same value [FEATURE ID: 15] and a same relative position [FEATURE ID: 15] as every other matching node . 5 . The method of claim 4 , wherein generating the mask generates the mask to have an extending node having the same relative position as each of the matching nodes [FEATURE ID: 10] , wherein the query tree comprises a query node having the same relative position as each of the matching nodes and the extending node , and wherein , when the mask is applied to the unit of input data to generate the query tree , the extending node propagates the value [FEATURE ID: 8] of the unit of input data ' s matching node to the query node . 6 . The method of claim 5 wherein the identified tree comprises an identified node having the value and the same relative position as the query node . 7 . The method of claim 2 , wherein the input data comprises a data node [FEATURE ID: 13] having a value , wherein the mask has an extending node at a same relative position as the data node , wherein the query tree comprises a query node at the same relative position as the data node and the extending node , wherein , when the mask is applied to the input data to generate the query tree , the extending node propagates the value of the data node to the query node , and wherein the identified tree comprises an identified node having the same relative position as the query node and having the value of the query node . 8 . The method of claim 3 further comprising : applying the mask to a second set [FEATURE ID: 4] of input data to generate a plurality of query trees [FEATURE ID: 8] each corresponding to a tree data structure , and each of the input data of the second set of input data corresponding to a tree data structure ; storing the plurality of query trees in a computer - readable memory ; applying the plurality of query trees to the collection of tree data structures in the database to identify a plurality of identified trees consistent [FEATURE ID: 10] with at least one of the plurality of query trees ; deleting the plurality of identified trees [FEATURE ID: 10] from the database ; and adding the second set of input data to the database . 9 . The method of claim 8 , wherein each of the input data of the second set of input data comprises a data node , wherein each data node has ( 1 ) a value , and ( 2 ) a same relative position as every other data node , wherein the mask has an extending node at the same relative position as each of the data nodes [FEATURE ID: 8] , wherein each of the plurality of query trees comprises a query node at the same relative position as each of the data nodes and the extending node , wherein , when the mask is applied to the second set of input data to generate the plurality of query trees , the extending node propagates the value of each of the data nodes to each of the respective query nodes [FEATURE ID: 12] , wherein the query nodes [FEATURE ID: 8] each have a different value [FEATURE ID: 14] , and wherein the plurality of identified trees each comprise an identified node having the same relative position as each of the query nodes and having a same value as one of the query nodes . 10 . The method of claim 2 wherein the collection of tree data structures comprise heterogeneous data [FEATURE ID: 8] . 11 . A system [FEATURE ID: 1] for updating a collection of tree data structures , the system comprising : a database component operative [FEATURE ID: 3] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050060332A1 Filed: 2001-12-20 Issued: 2005-03-17 Patent Holder: (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Inventor(s): Philip Bernstein, Jayant Madhavan Title: Methods and systems for model matching |
| [FEATURE ID: 1] method, form, numerical signal value | mechanism, device, technique, network, apparatus, model, process | [FEATURE ID: 1] system, comparison mechanism, means |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing | processing, analyzing, using, providing, updating, identifying, determining | [TRANSITIVE ID: 2] generating, comparing, first generating, third generating |
| [FEATURE ID: 3] database | system, memory, computer, data, server, first, second model | [FEATURE ID: 3] first data model, second data model |
| [TRANSITIVE ID: 4] comprising, including | using, and, containing, of, wherein, with, being | [TRANSITIVE ID: 4] comprising, having |
| [FEATURE ID: 5] physical memory devices, binary digital signals, non-terminal nodes, probe numerical signal values, trees, query fields, hierarchical query fields | nodes, structures, values, attributes, components, records, entries | [FEATURE ID: 5] model elements |
| [FEATURE ID: 6] signal values, partial subtrees, signals, node label values | data, information, links, representations, variables, nodes, parameters | [FEATURE ID: 6] similarity coefficients, second model elements |
| [FEATURE ID: 7] numerical signal values, states, nodes | parameters, values, vectors, elements, statistics, similarity, differences | [FEATURE ID: 7] inherent similarity coefficients, weighted similarity coefficients, data type compatibility, linguistic similarity coefficients |
| [FEATURE ID: 8] content | elements, components, structures, levels, values, nodes, objects | [FEATURE ID: 8] structural similarity coefficients, subtree elements, pairs, leaves |
| [FEATURE ID: 9] electronic content | information, content, data, elements, values | [FEATURE ID: 9] weighted similarity coefficient |
| [FEATURE ID: 10] claim | statement, preceding claim, the claim, figure, feature, claim of, requirement | [FEATURE ID: 10] claim |
| [FEATURE ID: 11] depth | threshold, value, constant, number, count, variable, weight | [FEATURE ID: 11] function, amount, variable threshold |
| [FEATURE ID: 12] presence, match | classification, distance, category, relevance, compatibility, dependency, proximity | [FEATURE ID: 12] similarity, constant |
| [FEATURE ID: 13] correspondence | comparison, measure, relationship, reference, combination, minimum, function | [FEATURE ID: 13] weighted function, condition, connection |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion thereof , comprising [TRANSITIVE ID: 4] : accessing [TRANSITIVE ID: 2] instructions from one or more physical memory devices [FEATURE ID: 5] for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 6] , including [TRANSITIVE ID: 4] numerical signal values [FEATURE ID: 7] , resulting from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 1] of a hierarchically structured tree via one or more numerical signal values corresponding to content [FEATURE ID: 8] within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 9] including binary digital signals [FEATURE ID: 5] and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 1] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 10] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 6] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 6] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 5] of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 7] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 11] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 6] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 5] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 12] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 5] and numerical signal values , and wherein a correspondence [FEATURE ID: 13] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match [FEATURE ID: 12] between the at least one probe numerical signal value and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 5] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 5] |
1 - 47 . ( cancelled ) 48 . A system [FEATURE ID: 1] for generating [TRANSITIVE ID: 2] similarity coefficients [FEATURE ID: 6] between model elements [FEATURE ID: 5] , comprising [TRANSITIVE ID: 4] : a first data model [FEATURE ID: 3] having [TRANSITIVE ID: 4] hierarchically organized first model elements ; a second data model [FEATURE ID: 3] having hierarchically organized second model elements [FEATURE ID: 6] ; a comparison mechanism [FEATURE ID: 1] for generating similarity coefficients between model elements when comparing [TRANSITIVE ID: 2] the first data model and the second data model , said mechanism comprising : means for first generating a plurality of inherent similarity coefficients [FEATURE ID: 7] for each pair of model elements , with each pair comprising a model element of said first model elements and a model element of said second model elements ; means for second generating a plurality of structural similarity coefficients [FEATURE ID: 8] for each pair of model elements based on a similarity [FEATURE ID: 12] of subtree elements [FEATURE ID: 8] rooted by the element pair , whereby each pair of model elements is assigned an initial structural similarity coefficient ; means for third generating a plurality of weighted similarity coefficients [FEATURE ID: 7] for each pair of model elements as a weighted function [FEATURE ID: 13] of said plurality of inherent similarity coefficients and said plurality of structural similarity coefficients ; and means for altering the similarity of said subtree elements rooted by the element pair for each pair of model elements , if a function [FEATURE ID: 11] based on said weighted similarity coefficient [FEATURE ID: 9] of said element pair meets a predetermined condition [FEATURE ID: 13] . 49 . The system of claim [FEATURE ID: 10] 48 , wherein said similarity of subtree elements includes similarity of pairs [FEATURE ID: 8] of subtree elements , with each pair of subtree elements comprising a model element of said first model elements and a model element of said second model elements . 50 . The system of claim 48 , wherein said means [FEATURE ID: 1] for second generating includes means for second generating a plurality of structural similarity coefficients for each pair of model elements based on a similarity of leaves [FEATURE ID: 8] rooted by the element pair . 51 . The system of claim 48 , whereby in connection [FEATURE ID: 13] with said means for second generating , said pairs of model elements are initially assigned structural similarity coefficients based a constant [FEATURE ID: 12] . 52 . The system of claim 48 , whereby in connection with said means for second generating , said pairs of model elements are initially assigned structural similarity coefficients based on data type compatibility [FEATURE ID: 7] . 53 . The system of claim 48 , whereby in connection with said means for second generating , only pairs of leaves are initially assigned structural similarity coefficients . 54 . The system of claim 48 , wherein for each pair of model elements , the similarity for said subtree elements rooted by the element pair is increased by a predetermined amount [FEATURE ID: 11] if said weighted similarity coefficient of said element pair exceeds a predefined , variable threshold [FEATURE ID: 11] . 55 . The system of claim 48 , wherein for each pair of model elements , the similarity for said subtree elements rooted by the element pair is decreased by a predetermined amount if said weighted similarity coefficient of said element pair is less than a predefined , variable threshold . 56 . The system of claim 48 , wherein said means for first generating [FEATURE ID: 2] includes means for first generating a plurality of linguistic similarity coefficients [FEATURE ID: 7] for each pair of model elements and said means for third generating [FEATURE ID: 2] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050060320A1 Filed: 2003-09-13 Issued: 2005-03-17 Patent Holder: (Original Assignee) Henrik Bostrom (Current Assignee) Compumine AB Inventor(s): Henrik Bostrom Title: Method for efficiently checking coverage of rules derived from a logical theory |
| [FEATURE ID: 1] method | system, program, process, technique, cryptographic method, device, procedure | [FEATURE ID: 1] method, computer |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing, including | using, compiling, reading, identifying, receiving, constructing, processing | [TRANSITIVE ID: 2] providing, having, generating, retrieving, transforming, converting, executing |
| [FEATURE ID: 3] database, query | computer, search, table, memory, server, repository, databases | [FEATURE ID: 3] database, coverage check apparatus, database query |
| [FEATURE ID: 4] portion, presence | representation, segment, section, fragment, state, structure, location | [FEATURE ID: 4] portion |
| [TRANSITIVE ID: 5] comprising | and, by, of, for, including, compromising, via | [TRANSITIVE ID: 5] comprising, using |
| [FEATURE ID: 6] instructions | contents, elements, data, information, items | [FEATURE ID: 6] tuples |
| [FEATURE ID: 7] signal values, numerical signal values, electronic content, states, partial subtrees, signals, non-terminal nodes, nodes, node label values, probe numerical signal values, trees, query fields | elements, parameters, variables, data, values, attributes, entries | [FEATURE ID: 7] clauses |
| [TRANSITIVE ID: 8] executed | performed, effected, conducted, executing, implemented, running | [TRANSITIVE ID: 8] used |
| [FEATURE ID: 9] tree, depth | list, hierarchy, root, leaf, network, graph, table | [FEATURE ID: 9] partial proof tree |
| [FEATURE ID: 10] content, hierarchical query fields | fields, entries, rows, records, rules, columns, children | [FEATURE ID: 10] nodes, database tables |
| [FEATURE ID: 11] binary digital signals | nodes, conditions, statements, structures, operations | [FEATURE ID: 11] possible rules |
| [FEATURE ID: 12] numerical signal value | application, instruction, process, server, request, expression, database | [FEATURE ID: 12] example, query, query checker |
| [FEATURE ID: 13] claim, probe numerical signal value | clause, node, the claim, description, preceding claim, embodiment, claims | [FEATURE ID: 13] claim, condition part |
| [FEATURE ID: 14] root nodes | part, plurality, subset, portion | [FEATURE ID: 14] resolvent |
| [FEATURE ID: 15] correspondence, match | comparison, mismatch, matching, change, similarity, difference, distance | [FEATURE ID: 15] match |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 6] from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 7] , including [TRANSITIVE ID: 2] numerical signal values [FEATURE ID: 7] , resulting from having executed [TRANSITIVE ID: 8] the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree [FEATURE ID: 9] via one or more numerical signal values corresponding to content [FEATURE ID: 10] within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 7] including binary digital signals [FEATURE ID: 11] and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 3] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 12] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 13] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 7] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 7] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 7] of the hierarchically structured tree , any root nodes [FEATURE ID: 14] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 7] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 9] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 7] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 7] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 4] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 7] and numerical signal values , and wherein a correspondence [FEATURE ID: 15] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match [FEATURE ID: 15] between the at least one probe numerical signal value [FEATURE ID: 13] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 7] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 10] |
1 . A method [FEATURE ID: 1] used [TRANSITIVE ID: 8] in a computer [FEATURE ID: 1] , comprising [TRANSITIVE ID: 5] : providing [TRANSITIVE ID: 2] a logical theory ( 12 , 30 ) having [TRANSITIVE ID: 2] clauses [FEATURE ID: 7] ; generating [TRANSITIVE ID: 2] a rule ( 14 ) that is a resolvent [FEATURE ID: 14] of clauses in the logical theory ; retrieving [TRANSITIVE ID: 2] an example [FEATURE ID: 12] ( 16 ) ; generating a proof tree ( 18 , 40 ) from the example ( 16 ) using [TRANSITIVE ID: 5] the logical theory ( 12 , 30 ) ; transforming [TRANSITIVE ID: 2] the proof tree ( 18 , 40 ) into a database [FEATURE ID: 3] ( 20 , 42 ) of a coverage check apparatus [FEATURE ID: 3] ( 28 ) ; converting [TRANSITIVE ID: 2] the rule ( 14 ) into a partial proof tree [FEATURE ID: 9] ( 60 ) having nodes [FEATURE ID: 10] ( 62 , 54 , 66 ) ; transforming the partial proof tree into a database query [FEATURE ID: 3] ( 22 ) of the coverage check apparatus ( 28 ) ; and executing [TRANSITIVE ID: 2] the query [FEATURE ID: 12] ( 22 , 72 ) to identify tuples [FEATURE ID: 6] in the database ( 20 , 42 ) that correspond to the nodes of the partial proof tree . 2 . The method according to claim [FEATURE ID: 13] 1 wherein the method further comprises determining whether the partial proof tree ( 60 ) is identical to a portion [FEATURE ID: 4] of the proof tree ( 18 , 40 ) . 3 . The method according to claim 1 wherein the method further comprises investigating for each rule ( 14 ) and each example ( 16 ) whether the rule ( 14 ) covers the example ( 16 ) . 4 . The method according to claim 3 wherein the method further comprises investigating whether a condition part [FEATURE ID: 13] of the rule ( 14 ) is satisfied by the example ( 16 ) . 5 . The method according to claim 1 wherein the method further comprises making the partial proof tree ( 60 ) more limiting than the logical theory ( 12 , 30 ) . 6 . The method according to claim 1 wherein the method further comprises concluding that the rule does not cover the example when no match [FEATURE ID: 15] is found in database tables [FEATURE ID: 10] . 7 . The method according to claim 6 wherein the method further comprises concluding that the rule does cover the example when a match is found in database tables . 8 . The method according to claim 1 wherein the method further comprises determining whether the tuples found in the database are associated with the same example . 9 . The method according to claim 1 wherein the method further comprises using the logical theory ( 12 , 30 ) to describe all possible rules [FEATURE ID: 11] that may be created . 10 . The method according to claim 1 wherein the method further comprises the query checker [FEATURE ID: 12] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050058976A1 Filed: 2003-09-16 Issued: 2005-03-17 Patent Holder: (Original Assignee) Vernon David H. Inventor(s): David Vernon Title: Program for teaching algebra |
| [FEATURE ID: 1] method, numerical signal value | process, device, means, way, scheme, server, system | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] querying, comprising, accessing, storing, including, having | providing, implementing, using, processing, executing, identifying, generating | [TRANSITIVE ID: 2] monitoring, comprising, receiving, displaying |
| [FEATURE ID: 3] database | computer, system, server, library, customer, human, person | [FEATURE ID: 3] user, database, teacher |
| [FEATURE ID: 4] instructions, transformation instructions, electronic content, binary digital signals, states, partial subtrees, signals, non-terminal nodes, nodes, node label values, probe numerical signal values, trees, query fields, hierarchical query fields | elements, data, structures, values, variables, attributes, conditions | [FEATURE ID: 4] mathematical problems, mathematical rules, respective data structures, common sub-expressions, data structures |
| [FEATURE ID: 5] processors | microprocessor, hardware, computers, cpu | [FEATURE ID: 5] computer |
| [TRANSITIVE ID: 6] executing | performing, processing, operating, interpreting, running, execution, analyzing | [TRANSITIVE ID: 6] implemented, comparing |
| [TRANSITIVE ID: 7] accessed, resulting | obtained, identified, provided, returned, received, stored, extracted | [TRANSITIVE ID: 7] adjacent |
| [FEATURE ID: 8] signal values | data, instructions, objects, variables, parameters | [FEATURE ID: 8] operands |
| [FEATURE ID: 9] numerical signal values | instructions, symbols, words, nodes, values, characters, integers | [FEATURE ID: 9] parent nodes, variables |
| [FEATURE ID: 10] content | attributes, nodes, elements, keys | [FEATURE ID: 10] child nodes common |
| [FEATURE ID: 11] query | request, prompt, comment, pointer, message, reference, connection | [FEATURE ID: 11] first statement, confirmation signal, hyperlink, page reference |
| [FEATURE ID: 12] claim | section, aspect, the claim, embodiment, item, paragraph, statement | [FEATURE ID: 12] claim |
| [FEATURE ID: 13] presence, probe numerical signal value | state, condition, node, root, attribute, level, validity | [FEATURE ID: 13] solution, child node |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion thereof , comprising [TRANSITIVE ID: 2] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 4] from one or more physical memory devices for execution by one or more processors [FEATURE ID: 5] ; executing [TRANSITIVE ID: 6] the instructions accessed [TRANSITIVE ID: 7] from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 8] , including [TRANSITIVE ID: 2] numerical signal values [FEATURE ID: 9] , resulting [TRANSITIVE ID: 7] from having [TRANSITIVE ID: 2] executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree via one or more numerical signal values corresponding to content [FEATURE ID: 10] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 4] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 4] including binary digital signals [FEATURE ID: 4] and / or states [FEATURE ID: 4] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 11] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 1] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 12] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 4] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 4] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 4] of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 4] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 4] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 4] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 13] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 4] and numerical signal values , and wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 13] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 4] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 4] |
1 . A method [FEATURE ID: 1] for monitoring [FEATURE ID: 2] and checking the solution [FEATURE ID: 13] of mathematical problems [FEATURE ID: 4] , the method comprising [TRANSITIVE ID: 2] the computer [FEATURE ID: 5] implemented [TRANSITIVE ID: 6] steps of : ( a ) receiving [TRANSITIVE ID: 2] a first statement [FEATURE ID: 11] from a user [FEATURE ID: 3] , wherein the first statement represents a mathematical problem ; ( b ) receiving subsequent statements from the user , wherein the subsequent statements represent steps in the solution of said mathematical problem ; ( c ) comparing [TRANSITIVE ID: 6] said statements against a database [FEATURE ID: 3] of mathematical rules [FEATURE ID: 4] ; ( d ) displaying [TRANSITIVE ID: 2] an error signal to the user if a statement does not follow from previous statements according to said mathematical rules ; and ( e ) displaying a confirmation signal [FEATURE ID: 11] to the user if the statement does follow from the previous statements according to said mathematical rules . 2 . The method according to claim [FEATURE ID: 12] 1 , further comprising : parsing the statements into respective data structures [FEATURE ID: 4] . 3 . The method according to claim 2 , further comprising removing common sub-expressions [FEATURE ID: 4] from the statements , wherein : ( 1 ) child nodes common [FEATURE ID: 10] to the data structures [FEATURE ID: 4] are removed from the data structures ; and ( 2 ) any parent nodes [FEATURE ID: 9] with only one remaining child node [FEATURE ID: 13] after step ( 1 ) are also removed from the data structures , and replaced with that child node . 4 . The method according to claim 2 , further comprising : refactoring common sub-expressions in the statements , wherein the common sub-expressions are replaced with variables [FEATURE ID: 9] . 5 . The method according to claim 2 , wherein the parsing supports implicit multiplication , wherein if two operands [FEATURE ID: 8] are adjacent [FEATURE ID: 7] in a statement without an operator between them , a multiply operator is inserted . 6 . The method according to claim 1 , wherein the database of mathematical rules contains both valid operations and invalid operations , wherein the invalid operations are included in the database to account for common mathematical errors . 7 . The method according to claim 1 , further comprising : if a rule is found in the database , displaying said rule to the user . 8 . The method according to claim 7 , further comprising at least one of the following : supplying a hyperlink [FEATURE ID: 11] to an online textbook : supplying a page reference [FEATURE ID: 11] to a print textbook ; supplying a hyperlink to an online tutorial ; and storing said rule in a database that may be reviewed by a teacher [FEATURE ID: 3] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050055369A1 Filed: 2003-09-10 Issued: 2005-03-10 Patent Holder: (Original Assignee) Exeros Inc (Current Assignee) Workday Inc Inventor(s): Alexander Gorelik, Lingling Yan Title: Method and apparatus for semantic discovery and mapping between data sources |
| [FEATURE ID: 1] method | methods, system, technique, methodology, scheme, procedure, mechanism | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing | generating, processing, analyzing, receiving, providing, building, obtaining | [TRANSITIVE ID: 2] identifying, discovering, using, determining, constructing, creating |
| [FEATURE ID: 3] database, probe numerical signal value | query, table, node, key, attribute, document, index | [FEATURE ID: 3] potential binding condition, first column index table |
| [FEATURE ID: 4] portion | subset, content, component, section | [FEATURE ID: 4] second data object |
| [TRANSITIVE ID: 5] comprising | including, by, includes, involves, having, and, compromising | [TRANSITIVE ID: 5] comprising, comprises |
| [FEATURE ID: 6] instructions | operations, data, information, contents | [FEATURE ID: 6] mappings |
| [FEATURE ID: 7] signal values, numerical signal values, binary digital signals, states, signals, node label values, trees, query fields, hierarchical query fields | values, attributes, parameters, variables, data, elements, conditions | [FEATURE ID: 7] semantics, value match scores, rows, columns |
| [FEATURE ID: 8] form, presence | model, schema, database, rule, condition, context, structure | [FEATURE ID: 8] transformation function, filter, binding condition expression |
| [FEATURE ID: 9] tree, query | key, list, response, view, reference, request, structure | [FEATURE ID: 9] first data object |
| [FEATURE ID: 10] content, partial subtrees, non-terminal nodes, nodes | elements, values, rows, entries, fields, attributes, information | [FEATURE ID: 10] relationships, portions, data, potential binding conditions, combinations, relevance scores |
| [FEATURE ID: 11] electronic content | information, data, links, values | [FEATURE ID: 11] correlations |
| [FEATURE ID: 12] numerical signal value | request, criterion, object, instruction, operation, query | [FEATURE ID: 12] condition |
| [FEATURE ID: 13] claim | preceding claim, pop claim, the claim, item, paragraph, clause, figure | [FEATURE ID: 13] claim |
| [FEATURE ID: 14] depth | threshold, maximum, value, score, minimum, number, count | [FEATURE ID: 14] highest total correlation score, highest total correlation, correlation threshold |
| [FEATURE ID: 15] probe numerical signal values | data, comparisons, matches, entries | [FEATURE ID: 15] correlation scores |
| [FEATURE ID: 16] correspondence | mapping, combination, comparison, linkage, match, similarity, distance | [FEATURE ID: 16] binding condition, correlation score |
| [FEATURE ID: 17] match | pairing, comparison, binding, correspondence | [FEATURE ID: 17] schema matching |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 6] from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 7] , including numerical signal values [FEATURE ID: 7] , resulting from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 8] of a hierarchically structured tree [FEATURE ID: 9] via one or more numerical signal values corresponding to content [FEATURE ID: 10] within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 11] including binary digital signals [FEATURE ID: 7] and / or states [FEATURE ID: 7] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 9] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 12] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 13] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 10] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 7] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 10] of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 10] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 14] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 7] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 15] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 8] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 7] and numerical signal values , and wherein a correspondence [FEATURE ID: 16] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match [FEATURE ID: 17] between the at least one probe numerical signal value [FEATURE ID: 3] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 7] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 7] |
1 . A method [FEATURE ID: 1] for identifying [TRANSITIVE ID: 2] semantics [FEATURE ID: 7] and relationships [FEATURE ID: 10] and mappings [FEATURE ID: 6] between a first and a second data source , the method comprising [TRANSITIVE ID: 5] : discovering [TRANSITIVE ID: 2] a binding condition [FEATURE ID: 16] between portions [FEATURE ID: 10] of data [FEATURE ID: 10] in the first and the second data source ; using [TRANSITIVE ID: 2] the binding condition to discover correlations [FEATURE ID: 11] between portions of data in the first and the second data source ; and using the binding condition and the correlations to discover a transformation function [FEATURE ID: 8] between portions of data in the first and the second data source . 2 . The method of claim [FEATURE ID: 13] 1 , further comprising discovering a filter [FEATURE ID: 8] for the binding condition 3 . The method of claim 1 , further comprising discovering a filter for the transformation function . 4 . The method of claim 1 , wherein discovering the binding condition comprises [TRANSITIVE ID: 5] determining [TRANSITIVE ID: 2] value match scores [FEATURE ID: 7] to identify a plurality of potential binding conditions [FEATURE ID: 10] . 5 . The method of claim 4 , wherein discovering the binding condition further comprises : for each potential binding condition [FEATURE ID: 3] , constructing [TRANSITIVE ID: 2] a binding condition expression [FEATURE ID: 8] , creating [TRANSITIVE ID: 2] a view of rows [FEATURE ID: 7] that match the binding condition expression , determining a correlation score [FEATURE ID: 16] between combinations [FEATURE ID: 10] of the columns [FEATURE ID: 7] from the first and the second data source , and adding the correlation scores [FEATURE ID: 15] ; and selecting the potential binding condition with a highest total correlation score [FEATURE ID: 14] as the binding condition if the highest total correlation [FEATURE ID: 14] is at least equal to a correlation threshold [FEATURE ID: 14] . 6 . The method of claim 5 , further comprising for each potential binding condition : creating a first list of combinations of columns from the first data source that are excluded from the potential binding condition ; and creating a second list of combinations of columns from the second data source that are excluded from the potential binding condition . 7 . The method of claim 1 , further comprising : discovering a join condition [FEATURE ID: 12] ; and using the join condition to generate a first data object [FEATURE ID: 9] for the first data source . 8 . The method of claim 7 , further comprising performing schema matching [FEATURE ID: 17] between the first data object and a second data object [FEATURE ID: 4] of the second data source . 9 . The method of claim 8 , wherein performing schema matching comprises constructing a metadata index including relevance scores [FEATURE ID: 10] . 10 . The method of claim 9 , wherein the relevance scores are determined using a multiplier . 11 . The method of claim 1 , wherein discovering the binding condition comprises : creating a first column index table [FEATURE ID: 3] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050050066A1 Filed: 2003-08-29 Issued: 2005-03-03 Patent Holder: (Original Assignee) Cybertrust Ireland Ltd (Current Assignee) Cybertrust Ireland Ltd Inventor(s): Merlin Hughes Title: Processing XML node sets |
| [FEATURE ID: 1] method | means, methodology, automated method, dynamic method, scheme, computer method, system | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing | processing, using, identifying, providing, receiving, detecting, generating | [TRANSITIVE ID: 2] enumerating, deriving |
| [FEATURE ID: 3] database | network, file, table, structure, node tree, node, system | [FEATURE ID: 3] particular tree, document, tree |
| [FEATURE ID: 4] portion, tree, presence | representation, subset, structure, forest, quantity, range, network | [FEATURE ID: 4] set |
| [TRANSITIVE ID: 5] comprising, including | having, using, wherein, involves, containing, and, with | [TRANSITIVE ID: 5] comprising |
| [FEATURE ID: 6] instructions, numerical signal values, electronic content, binary digital signals, states, signals, non-terminal nodes, nodes, node label values, probe numerical signal values, trees, query fields, hierarchical query fields | elements, parameters, values, structures, information, attributes, variables | [FEATURE ID: 6] nodes, root nodes |
| [FEATURE ID: 7] execution | application, operation, analysis, interpretation | [FEATURE ID: 7] manipulation |
| [FEATURE ID: 8] signal values | parameters, variables, metadata, objects | [FEATURE ID: 8] additional node tests |
| [TRANSITIVE ID: 9] resulting | provided, identified, derived, determined | [TRANSITIVE ID: 9] specified |
| [FEATURE ID: 10] form | structure, expression, definition, query, context, formation, specification | [FEATURE ID: 10] representation, node set |
| [FEATURE ID: 11] content, partial subtrees | elements, leaves, structures, nodes, paths, links, rows | [FEATURE ID: 11] trees, comment nodes |
| [FEATURE ID: 12] numerical signal value | node, parameter, query, field | [FEATURE ID: 12] label value |
| [FEATURE ID: 13] claim | aspect, previous claim, figure, requirement, preceding claim, embodiment, clause | [FEATURE ID: 13] claim |
| [FEATURE ID: 14] root nodes | number, plurality, structure, subset, tree | [FEATURE ID: 14] forest |
| [FEATURE ID: 15] depth | list, number, label, value | [FEATURE ID: 15] document URI |
| [FEATURE ID: 16] probe numerical signal value | node, tree, name, code, query, identifier, string | [FEATURE ID: 16] URI, name URI, XPointer expression |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 6] from one or more physical memory devices for execution [FEATURE ID: 7] by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 8] , including [TRANSITIVE ID: 5] numerical signal values [FEATURE ID: 6] , resulting [TRANSITIVE ID: 9] from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 10] of a hierarchically structured tree [FEATURE ID: 4] via one or more numerical signal values corresponding to content [FEATURE ID: 11] within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 6] including binary digital signals [FEATURE ID: 6] and / or states [FEATURE ID: 6] ; and wherein the executing the transformation instructions comprises : presenting a query to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 12] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 13] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 11] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 6] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 6] of the hierarchically structured tree , any root nodes [FEATURE ID: 14] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 6] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 15] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 6] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 6] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 4] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 6] and numerical signal values , and wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 16] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 6] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 6] |
1 . A method [FEATURE ID: 1] for enumerating [TRANSITIVE ID: 2] a node set in an XML document comprising [TRANSITIVE ID: 5] : a. deriving [TRANSITIVE ID: 2] a representation [FEATURE ID: 10] that describes a set [FEATURE ID: 4] of nodes [FEATURE ID: 6] that includes the node set [FEATURE ID: 10] ; and b. enumerating the set of nodes specified [TRANSITIVE ID: 9] by the representation . 2 . A method for enumerating a node set in an XML document according to claim [FEATURE ID: 13] 1 in which the node set is defined in terms of : a. a forest [FEATURE ID: 14] of trees [FEATURE ID: 11] that contain all the nodes of the node set ; b. a forest of trees that contain no nodes from the node set ; c. a set of additional node tests [FEATURE ID: 8] that characterize the node set . 3 . A method for enumerating a node set in an XML document according to claim 1 in which step a. derives the representation from a universal resource indicator that describes the node set . 4 . A method for enumerating a node set in an XML document according to claim 3 in which the URI [FEATURE ID: 16] is a whole - document URI [FEATURE ID: 15] . 5 . A method for enumerating a node set in an XML document according to claim 3 in which the URI dereferences to a node set containing every node in the XML document with the exception of comment nodes [FEATURE ID: 11] . 6 . A method for enumerating a node set in an XML document according to claim 3 in which the URI is a bare - name URI [FEATURE ID: 16] . 7 . A method for enumerating a node set in an XML document according to claim 6 in which the URI dereferences to a node set containing every node of a particular tree [FEATURE ID: 3] in the document [FEATURE ID: 3] with the exception of comment nodes , the tree [FEATURE ID: 3] being rooted at an element node that is identified by the label value [FEATURE ID: 12] from the URI . 8 . A method for enumerating a node set in an XML document according to claim 3 in which the URI is an XPointer URI . 9 . A method for enumerating a node set in an XML document according to claim 8 in which the URI dereferences to a node set containing every node from a forest of trees in the document , the trees are rooted by a set of nodes that is computed by evaluating the XPointer expression [FEATURE ID: 16] . 10 . A method for enumerating a node set in an XML document according to claim 9 in which the XPointer expression is analyzed to determine whether the root nodes [FEATURE ID: 6] to which it evaluates are in document order . 11 . A method for enumerating a node set in an XML document according to claim 10 in which a sort operation is performed on the root nodes in the event that the analysis shows that they are not in document order . 12 . A method for enumerating a node set in an XML document according to claim 1 in which a transform is applied to the initial node set by manipulation [FEATURE ID: 7] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US20050050016A1 Filed: 2003-09-02 Issued: 2005-03-03 Patent Holder: (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Inventor(s): Ioana Stanoi, Christian Lang, Sriram Padmanabhan Title: Selective path signatures for query processing over a hierarchical tagged data structure |
| [FEATURE ID: 1] method | means, methodology, data method, scheme, computer method, system, process | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] querying, accessing, executing | storing, generating, analyzing, using, evaluating, constructing, determining | [TRANSITIVE ID: 2] processing, providing, pruning, updating |
| [FEATURE ID: 3] database, numerical signal value | query, server, network, file, search, computer, system | [FEATURE ID: 3] computing device, child node accessible |
| [TRANSITIVE ID: 4] comprising, including | with, and, containing, involving, of, wherein, via | [TRANSITIVE ID: 4] using, said, having |
| [TRANSITIVE ID: 5] storing | creating, including, providing, generating, identifying | [TRANSITIVE ID: 5] being |
| [FEATURE ID: 6] signal values, numerical signal values, states | information, events, metadata, parameters, data, metrics, instructions | [FEATURE ID: 6] hints, updates, limitations |
| [TRANSITIVE ID: 7] resulting | provided, computed, generated, determined | [TRANSITIVE ID: 7] navigational aids |
| [TRANSITIVE ID: 8] executed | used, executing, effected, applied, initiated, processed, implemented | [TRANSITIVE ID: 8] performed |
| [FEATURE ID: 9] tree | list, leaf, structure, child, root, path, hierarchy | [FEATURE ID: 9] sub tree, current node n |
| [FEATURE ID: 10] content, partial subtrees, nodes, node label values, trees | elements, attributes, values, links, levels, fields, edges | [FEATURE ID: 10] nodes l, children c |
| [FEATURE ID: 11] transformation instructions, query fields | query, attributes, operations, content, values, properties, processing | [FEATURE ID: 11] navigation workload |
| [FEATURE ID: 12] electronic content, non-terminal nodes, probe numerical signal values, hierarchical query fields | nodes, data, entries, attributes, values, structures, trees | [FEATURE ID: 12] queries, techniques, hint information |
| [FEATURE ID: 13] binary digital signals | activities, states, elements, functions, operations | [FEATURE ID: 13] steps |
| [FEATURE ID: 14] query, presence | state, type, reference, context, name, pointer, location | [FEATURE ID: 14] tag |
| [FEATURE ID: 15] claim | preceding claim, claim of, embodiment, item, claims, paragraph, any claim | [FEATURE ID: 15] claim |
| [FEATURE ID: 16] root nodes, probe numerical signal value | root, branch, node, subset, leaf, part, brother | [FEATURE ID: 16] parent, child |
| [FEATURE ID: 17] depth | label, branch, layer, leaf | [FEATURE ID: 17] node n |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion thereof , comprising [TRANSITIVE ID: 4] : accessing [TRANSITIVE ID: 2] instructions from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 5] , in at least one of the physical memory devices , signal values [FEATURE ID: 6] , including [TRANSITIVE ID: 4] numerical signal values [FEATURE ID: 6] , resulting [TRANSITIVE ID: 7] from having executed [TRANSITIVE ID: 8] the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree [FEATURE ID: 9] via one or more numerical signal values corresponding to content [FEATURE ID: 10] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 11] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 12] including binary digital signals [FEATURE ID: 13] and / or states [FEATURE ID: 6] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 14] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 3] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 15] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees [FEATURE ID: 10] of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 12] of the hierarchically structured tree , any root nodes [FEATURE ID: 16] of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 10] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth [FEATURE ID: 17] to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 10] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 12] with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 14] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 10] and numerical signal values , and wherein a correspondence between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match between the at least one probe numerical signal value [FEATURE ID: 16] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 11] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 12] |
1 . A method [FEATURE ID: 1] for processing [TRANSITIVE ID: 2] queries [FEATURE ID: 12] of hierarchical tagged data using [TRANSITIVE ID: 4] hints [FEATURE ID: 6] , said [TRANSITIVE ID: 4] hints being [TRANSITIVE ID: 5] navigational aids [FEATURE ID: 7] and said processing being performed [TRANSITIVE ID: 8] on a computing device [FEATURE ID: 3] , providing [TRANSITIVE ID: 2] a plurality of hints for the hierarchical tagged data , said data having [TRANSITIVE ID: 4] a plurality of nodes l [FEATURE ID: 10] and c such that l is a parent [FEATURE ID: 16] of c ; pruning [FEATURE ID: 2] said plurality of hints to avoid unnecessary navigation when processing said queries ; updating [TRANSITIVE ID: 2] said hints in accordance with required navigation workload [FEATURE ID: 11] and updates [FEATURE ID: 6] and changes to the hierarchical tagged data ; and selecting techniques [FEATURE ID: 12] for hints according to limitations [FEATURE ID: 6] on an allocated memory size of said computing device . 2 . The method of claim [FEATURE ID: 15] 1 , wherein the hint being represented as h ( l , c , t ) , where t is a tag [FEATURE ID: 14] of a child node accessible [FEATURE ID: 3] in top - down traversal from c , said hint being positive if t exists and otherwise negative . 3 . The method of claim 1 , further comprising the steps [FEATURE ID: 13] of : matching hint information [FEATURE ID: 12] at a currently accessed node n [FEATURE ID: 17] with a remaining query path q ; analyzing all hints where c is a child [FEATURE ID: 16] of node n ; and eliminating from query processing a sub tree [FEATURE ID: 9] rooted at each child c of node n having a tag t. 4 . The method of claim 1 , further comprising the steps of : a ) for every query path q , identifying all children c [FEATURE ID: 10] of a current node n [FEATURE ID: 9] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US6859803B2 Filed: 2001-11-13 Issued: 2005-02-22 Patent Holder: (Original Assignee) Koninklijke Philips Electronics NV (Current Assignee) Koninklijke Philips NV Inventor(s): Serhan Dagtas, Radu S. Jasinschi, Nevenka Dimitrova Title: Apparatus and method for program selection utilizing exclusive and inclusive metadata searches |
| [FEATURE ID: 1] method | means, mode, device, capable, step, mechanism, manner | [FEATURE ID: 1] metadata search controller capable |
| [TRANSITIVE ID: 2] querying, accessing, executing, storing | processing, providing, reading, using, generating, managing, analyzing | [TRANSITIVE ID: 2] identifying, receiving, executing |
| [FEATURE ID: 3] database, tree | document, query, file, search, record, computer, server | [FEATURE ID: 3] multimedia program, word pair database, search field, user instruction |
| [FEATURE ID: 4] portion | fragment, component, segment, feature, term, metadata, section | [FEATURE ID: 4] word, metadata word |
| [TRANSITIVE ID: 5] comprising | comprises, includes, having, including, has, involving, of | [TRANSITIVE ID: 5] contains, comprising, word pair matches |
| [FEATURE ID: 6] instructions, content, transformation instructions, electronic content, binary digital signals, states, non-terminal nodes, nodes, trees, query fields | elements, information, values, objects, structures, entries, items | [FEATURE ID: 6] metadata, words present |
| [TRANSITIVE ID: 7] accessed, resulting | received, identified, provided, selected, requested, extracted, returned | [TRANSITIVE ID: 7] specified |
| [FEATURE ID: 8] signal values, node label values, hierarchical query fields | fields, categories, variables, data, results, values, depths | [FEATURE ID: 8] search fields |
| [FEATURE ID: 9] numerical signal values, probe numerical signal values | text, records, signals, results, vectors, entries, matches | [FEATURE ID: 9] word pairs |
| [FEATURE ID: 10] query, target numerical signal value, probe numerical signal value | key, name, result, user, search, value, criterion | [FEATURE ID: 10] search word, second search field |
| [FEATURE ID: 11] numerical signal value, association | identification, index, application, evaluation, operation, output, search | [FEATURE ID: 11] inclusive metadata search, inclusive search request, exclusive metadata search |
| [FEATURE ID: 12] claim | paragraph, figure, requirement, preceding claim, clause, embodiment, item | [FEATURE ID: 12] claim |
| [FEATURE ID: 13] signals | words, signs, functions, elements | [FEATURE ID: 13] logical operators |
| [FEATURE ID: 14] presence | characteristic, value, property, magnitude, similarity, context, type | [FEATURE ID: 14] relative significance, relationship, number, relative importance |
| [FEATURE ID: 15] correspondence, match | relationship, similarity, proximity, distance, pairing, combination, mismatch | [FEATURE ID: 15] match, word pair |
| 1 . A method [FEATURE ID: 1] of querying [TRANSITIVE ID: 2] a database [FEATURE ID: 3] , or a portion [FEATURE ID: 4] thereof , comprising [TRANSITIVE ID: 5] : accessing [TRANSITIVE ID: 2] instructions [FEATURE ID: 6] from one or more physical memory devices for execution by one or more processors ; executing [TRANSITIVE ID: 2] the instructions accessed [TRANSITIVE ID: 7] from the one or more physical memory devices by the one or more processors ; storing [TRANSITIVE ID: 2] , in at least one of the physical memory devices , signal values [FEATURE ID: 8] , including numerical signal values [FEATURE ID: 9] , resulting [TRANSITIVE ID: 7] from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form of a hierarchically structured tree [FEATURE ID: 3] via one or more numerical signal values corresponding to content [FEATURE ID: 6] within the database , or the portion thereof ; wherein the executing the transformation instructions [FEATURE ID: 6] comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content [FEATURE ID: 6] including binary digital signals [FEATURE ID: 6] and / or states [FEATURE ID: 6] ; and wherein the executing the transformation instructions comprises : presenting a query [FEATURE ID: 10] to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 11] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 12] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals [FEATURE ID: 13] and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association [FEATURE ID: 11] of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes [FEATURE ID: 6] of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes [FEATURE ID: 6] descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values [FEATURE ID: 8] associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values [FEATURE ID: 9] with at least one target numerical signal value [FEATURE ID: 10] of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 14] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees [FEATURE ID: 6] and numerical signal values , and wherein a correspondence [FEATURE ID: 15] between at least one of the one or more probe numerical signal values and the at least one target numerical signal value includes a match [FEATURE ID: 15] between the at least one probe numerical signal value [FEATURE ID: 10] and the at least one target numerical signal value . 7 . The method of claim 1 , and wherein the executing the transformation instructions further comprises : locating the content in the database , or the portion thereof . 8 . The method of claim 1 , wherein the executing the transformation instructions comprises identifying one or more query fields [FEATURE ID: 6] of the query . 9 . The method of claim 8 , wherein the executing the transformation instructions comprises enumerating at least some hierarchical query fields [FEATURE ID: 8] |
1 . An apparatus for identifying [TRANSITIVE ID: 2] a multimedia program [FEATURE ID: 3] that contains [TRANSITIVE ID: 5] at least one word [FEATURE ID: 4] that is related to a user specified [TRANSITIVE ID: 7] search word [FEATURE ID: 10] , said apparatus comprising [TRANSITIVE ID: 5] : a metadata search controller capable [FEATURE ID: 1] of receiving [TRANSITIVE ID: 2] metadata [FEATURE ID: 6] that contains words present [FEATURE ID: 6] in said multimedia program ; wherein said metadata search controller is capable of executing [TRANSITIVE ID: 2] an inclusive metadata search [FEATURE ID: 11] that is capable of identifying a match [FEATURE ID: 15] between said user specified search word and a metadata word [FEATURE ID: 4] of said multimedia program that is related to said user specified search word . 2 . The apparatus as claimed in claim [FEATURE ID: 12] 1 wherein said metadata search controller comprises : a word pair database [FEATURE ID: 3] that contains a plurality of word pairs [FEATURE ID: 9] wherein each word pair [FEATURE ID: 15] in said word pair database comprises a first word and a second word ; and a word pair weight factor assigned to each word pair in said word pair database , said word pair weight factor indicating a relative significance [FEATURE ID: 14] of a relationship [FEATURE ID: 14] between said first word and said second word of said word pair . 3 . The apparatus as claimed in claim 2 wherein said metadata search controller is capable of executing an inclusive metadata search that is capable of identifying at least one word pair in said word pair database wherein one word of said word pair matches a metadata word of said multimedia program and wherein another word of said word pair matches [FEATURE ID: 5] said user specified search word . 4 . The apparatus as claimed in claim 3 wherein said metadata search controller is capable of assigning a search field weight factor to each of a plurality of search fields [FEATURE ID: 8] in said inclusive metadata search wherein said search field weight factor is a number [FEATURE ID: 14] that reflects a relative importance [FEATURE ID: 14] of a search field [FEATURE ID: 3] . 5 . The apparatus as claimed in claim 4 wherein said metadata search controller is capable of receiving a search field weight factor from one of : ( 1 ) a user instruction [FEATURE ID: 3] and ( 2 ) information concerning user viewing habits . 6 . The apparatus as claimed in claim 3 wherein said metadata search controller is capable of assigning a word pair weight factor to at least one word pair in said word pair database . 7 . The apparatus as claimed in claim 6 wherein said metadata search controller is capable of receiving a word pair weight factor from one of : ( 1 ) a user instruction and ( 2 ) information concerning user viewing habits . 8 . The apparatus as claimed in claim 4 wherein said metadata search controller is capable of receiving an inclusive search request [FEATURE ID: 11] comprising a plurality of search fields where a relationship between a first search field and a second search field [FEATURE ID: 10] is expressed by one of : logical operator AND , logical operator OR , logical operator NOT , and a logical operator comprising a combination of said logical operators [FEATURE ID: 13] AND , OR , and NOT . 9 . The apparatus as claimed in claim 1 wherein said metadata search controller is capable of executing an exclusive metadata search [FEATURE ID: 11] |
| Targeted Patent: Patent: US11100070B2 Filed: 2005-04-29 Issued: 2021-08-24 Patent Holder: (Original Assignee) Individual (Current Assignee) Robert T And Virinia T Jenkins As Trustees Of Jenkins Family Trust Dated Feb 8 2002 ; Lower48 IP LLC Inventor(s): Karl Schiffmann, Jack J. Letourneau, Mark Andrews Title: Manipulation and/or analysis of hierarchical data | Cross Reference / Shared Meaning between the Lines |
Charted Against: Patent: US6854976B1 Filed: 2002-11-02 Issued: 2005-02-15 Patent Holder: (Original Assignee) John S. Suhr Inventor(s): John S. Suhr Title: Breast model teaching aid and method |
| [FEATURE ID: 1] method | methods, process, procedure, way, methodology, system, technique | [FEATURE ID: 1] method |
| [TRANSITIVE ID: 2] comprising | including, includes, of, having, for, with, has | [TRANSITIVE ID: 2] comprising, pliable material housing, comprises |
| [FEATURE ID: 3] form | behavior, configuration, functionality, state | [FEATURE ID: 3] condition |
| [FEATURE ID: 4] numerical signal value | output, object, instruction, device, operation | [FEATURE ID: 4] alarm device |
| [FEATURE ID: 5] claim | preceding claim, claim of, embodiment, item, claims, paragraph, clause | [FEATURE ID: 5] claim |
| [FEATURE ID: 6] presence, correspondence | characteristic, condition, property, change, proximity, similarity, location | [FEATURE ID: 6] movement |
| 1 . A method [FEATURE ID: 1] of querying a database , or a portion thereof , comprising [TRANSITIVE ID: 2] : accessing instructions from one or more physical memory devices for execution by one or more processors ; executing the instructions accessed from the one or more physical memory devices by the one or more processors ; storing , in at least one of the physical memory devices , signal values , including numerical signal values , resulting from having executed the accessed instructions on the one or more processors , wherein the one or more physical memory devices also store the database , or the portion thereof ; wherein the accessed instructions to transform the database , or the portion thereof , to the form [FEATURE ID: 3] of a hierarchically structured tree via one or more numerical signal values corresponding to content within the database , or the portion thereof ; wherein the executing the transformation instructions comprises : generating the hierarchically structured tree via the one or more numerical signal values , the hierarchically structured tree comprising electronic content including binary digital signals and / or states ; and wherein the executing the transformation instructions comprises : presenting a query to the database , or the portion thereof , via at least one numerical signal value [FEATURE ID: 4] to fetch the content within the database , or the portion thereof . 2 . The method of claim [FEATURE ID: 5] 1 , and wherein the executing the transformation instructions comprises : identifying at least some of a plurality of partial subtrees of the hierarchically structured tree , wherein the plurality of partial subtrees are also in the form of signals and / or states ; enumerating at least some partial subtrees of the at least some identified partial subtrees ; associating the at least one numerical signal value with at least one of the at least some enumerated partial subtrees ; and determining the at least one numerical signal value based , at least in part , on an association of numerical signal values with at least some of the at least some enumerated partial subtrees of the at least some identified partial subtrees . 3 . The method of claim 2 , wherein the identifying the at least some of the plurality of partial subtrees of the hierarchically structured tree comprises : identifying , from non-terminal nodes of the hierarchically structured tree , any root nodes of the at least some identified partial subtrees ; and identifying one or more nodes descending from the root node of the at least some identified partial subtrees to be one or more nodes of the at least some enumerated partial subtrees . 4 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees down to a depth to be one or more nodes of the at least some enumerated partial subtrees . 5 . The method of claim 3 , wherein the identifying one or more nodes descending from the root node of the at least some identified partial subtrees comprises identifying the one or more nodes descending from the root node of the at least some identified partial subtrees based , at least in part , on one or more node label values associated with the one or more nodes . 6 . The method of claim 1 , and wherein the executing the transformation instructions comprises : comparing one or more probe numerical signal values with at least one target numerical signal value of the one or more numerical signal values , which is indicative of a presence [FEATURE ID: 6] of the content in the database , or the portion thereof , wherein the one or more probe numerical signal values are also based , at least in part , on an association of trees and numerical signal values , and wherein a correspondence [FEATURE ID: 6] |
1 . A teaching aid comprising [TRANSITIVE ID: 2] : a soft model of a human breast ; an imitation lump mounted inside the model ; an electric switch connected to the imitation lump ; and wherein a movement [FEATURE ID: 6] of the imitation lump changes a condition [FEATURE ID: 3] of the switch to activate an alarm device [FEATURE ID: 4] . 2 . The apparatus of claim [FEATURE ID: 5] 1 further comprising an insert of the pliable material housing [FEATURE ID: 2] the electric switch , wherein the imitation lump protrudes therefrom , and the insert is mountable in the model of the human breast at a desired orientation . 3 . The apparatus of claim 2 , wherein the electric switch further comprises [TRANSITIVE ID: 2] a plunger activator , and the imitation lump is a solid mass attached to the plunger activator . 4 . The apparatus of claim 3 , wherein the alarm device further comprises a light . 5 . The apparatus of claim 4 further comprising a base that supports the model , the light and a battery . 6 . The apparatus of claim 5 , wherein the alarm device further comprises a voice storage device with a speaker . 7 . The apparatus of claim 2 further comprising a plurality of inserts . 8 . The apparatus of claim 2 , wherein the model further comprises a nipple segment , a skin segment and an interior segment . 9 . Training aid comprising : a base having a battery and an alarm device mounted therein ; a soft , pliable model of a human breast mounted on the base ; said model having an insert inside which is mounted at a chosen orientation ; wherein the insert has a solid mass protruding therefrom which triggers an electric switch in the insert when the solid mass is pushed ; and wherein the electric switch activates the alarm device . 10 . The apparatus of claim 9 , wherein the electric switch has plunger , and the solid mass further comprises a sphere chosen to have a specific diameter to simulate a cancerous lump , said sphere attached to the plunger . 11 . The apparatus of claim 9 , wherein the alarm device is light . 12 . The apparatus of claim 9 , wherein the model further comprises a nipple segment , a skin segment and an interior segment . 13 . The apparatus of claim 12 , wherein the model is made of silicone . 14 . A method [FEATURE ID: 1] |