Back to results
US 11,636,079 B2Granted
Enumeration of rooted partial subtrees
AssigneeLower48 IP LLC
InventorsKarl Schiffmann, Jack J. Letourneau, Mark Andrews
Life of this patent
Estimating the term…
Abstract
Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed.
Claims20
A method of executing instructions on at least one computing device including at least one processor and at least one memory, the method comprising:
- executing the instructions on the at least one processor of the at least one computing device, wherein the instructions comprise instructions for database processing, and wherein the executing the instructions comprises:
- representing stored content of a database, at least in part, as a data representation, wherein the data representation comprises a set of subtrees and/or partial subtrees;
- representing a query as a numeral;
- comparing the numeral with one or more numerals, wherein a result of the comparing is stored in the at least one memory of the at least one computing device;
- enumerating the set of subtrees and/or partial subtrees for the data representation, or a portion thereof, wherein the set of subtrees and/or partial subtrees comprises at least a first partial subtree having a same node as a second partial subtree, and wherein the one or more numerals represent the set of subtrees and/or partial subtrees of the data representation as enumerated;
- and
- returning at least one or more corresponding partial subtrees of the set of subtrees and/or partial subtrees based, at least in part, on the result of the comparing.
4 more elements
An apparatus comprising:
- at least one computing device including at least one processor and at least one memory;
- and
- the at least one memory to communicate instructions to the at least one processor and the at least one processor to execute the instructions communicated to the at least one processor, wherein the communicated instructions to be executed comprise instructions for database processing, and wherein the instructions for database processing to be executed comprise instructions to:
- represent stored content of a database, at least in part, as a data representation, wherein the data representation to comprise a set of subtrees and/or partial subtrees;
- represent a query as a numeral;
- compare the numeral with one or more numerals, a result of the comparison being stored in the at least one memory of the at least one computing device;
- enumerate the set of subtrees and/or partial subtrees for the data representation, or a portion thereof, wherein the set of subtrees and/or partial subtrees to comprise at least a first partial subtree to have a same node as a second partial subtree, and wherein the one or more numerals represent the set of subtrees and/or partial subtrees of the data representation as enumerated;
- and
- return at least one or more corresponding partial subtrees of the set of subtrees and/or partial subtrees based, at least in part, on the result of the comparison.
6 more elements
An article comprising:
- a non-transitory storage medium having machine-readable instructions stored thereon executable by at least one computing device comprising at least one processor and at least one memory, the at least one computing device to execute instructions on the at least one processor;
- wherein the instructions to be executed to comprise instructions for database processing, and wherein the execution of the instructions for database processing comprises execution of instructions to:
- represent stored content of a database, at least in part, as a data representation, wherein the data representation to comprise a set of subtrees and/or partial subtrees;
- represent a query as a numeral;
- compare the numeral with one or more numerals, a result of the comparison being stored in the at least one memory of the at least one computing device;
- enumerate the set of subtrees and/or partial subtrees for the data representation, or a portion thereof, wherein the set of subtrees and/or partial subtrees to comprise at least a first partial subtree to have a same node as a second partial subtree, and wherein the one or more numerals represent the set of subtrees and/or partial subtrees of the data representation as enumerated;
- and
- return at least one or more corresponding partial subtrees of the set of subtrees and/or partial subtrees based, at least in part, on the result of the comparison.
5 more elements
Dependencies are inferred from the claim text.