Enumeration of rooted partial subtrees
First Claim
Patent Images
1. A method of executing computer instructions on at least one computing device in which the at least one computing device includes at least one processor and at least one memory, the method comprising:
- executing the computer instructions on the at least one processor of the at least one computing device;
wherein the computer instructions to be executed comprise instructions for query processing;
wherein the executing the query processing instructions comprise;
representing a query as a numeral;
comparing the query numeral with one or more numerals representing rooted partial subtrees of a complex tree hierarchy for a set of electronic documents; and
storing the result of the comparison in the at least one memory of the at least one computing device;
wherein the executing the query processing instructions further comprise;
enumerating a set of rooted partial subtrees for the complex tree hierarchy, wherein the set of rooted partial subtrees comprises at least one rooted partial subtree having a same node as a second rooted partial subtree;
determining one or more digital signals for numerals associated with the enumerated rooted partial subtrees of the set; and
returning one or more corresponding rooted partial subtrees of the set based, at least in part, on the comparison.
3 Assignments
0 Petitions
Accused Products
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.
-
Citations
20 Claims
-
1. A method of executing computer instructions on at least one computing device in which the at least one computing device includes at least one processor and at least one memory, the method comprising:
-
executing the computer instructions on the at least one processor of the at least one computing device; wherein the computer instructions to be executed comprise instructions for query processing; wherein the executing the query processing instructions comprise; representing a query as a numeral; comparing the query numeral with one or more numerals representing rooted partial subtrees of a complex tree hierarchy for a set of electronic documents; and storing the result of the comparison in the at least one memory of the at least one computing device; wherein the executing the query processing instructions further comprise; enumerating a set of rooted partial subtrees for the complex tree hierarchy, wherein the set of rooted partial subtrees comprises at least one rooted partial subtree having a same node as a second rooted partial subtree; determining one or more digital signals for numerals associated with the enumerated rooted partial subtrees of the set; and returning one or more corresponding rooted partial subtrees of the set based, at least in part, on the comparison. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An apparatus comprising:
-
means for executing computer instructions comprising at least one processor; wherein the computer instructions being executed comprise instructions for query processing; wherein the means for executing instructions comprises; means for representing a query as a numeral and comparing the query numeral with one or more numerals representing rooted partial subtrees of a complex tree hierarchy for a set of electronic documents; and means for storing the result of the comparison in the at least one memory of the at least one computing device; wherein the means for executing the query processing instructions further comprises; means for enumerating a set of rooted partial subtrees for the complex tree hierarchy, wherein the set of rooted partial subtrees comprises at least one rooted partial subtree having a same node as a second rooted partial subtree; means for determining one or more digital signals for numerals associated with the enumerated rooted partial subtrees of the set; and returning one or more corresponding rooted partial subtrees of the set based, at least in part, on the comparison. - View Dependent Claims (11, 12, 13, 14)
-
-
15. An apparatus comprising:
-
at least one computing device including at least one processor and at least one memory, the at least one computing device to execute computer instructions on the at least one processor; the computer instructions to be executed comprising instructions for query processing; wherein execution of the query processing instructions to comprise instructions to; represent a query as a numeral and compare the query numeral with one or more numerals to represent rooted partial subtrees of a complex tree hierarchy for a set of electronic documents; and store the result of the comparison in the at least one memory of the at least one computing device; wherein the query processing instructions further to comprise instructions to; enumerate a set of rooted partial subtrees for the complex tree hierarchy, wherein the set of rooted partial subtrees to comprise at least one rooted partial subtree to have a same node as a second rooted partial subtree; determine one or more digital signals for numerals to be associated with the enumerated rooted partial subtrees of the set; and return one or more rooted partial subtrees of the set to correspond to and to be based, at least in part, on the comparison. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification