Enumeration of rooted partial subtrees
First Claim
Patent Images
1. A method comprising:
- executing instructions by a processor to;
exhaustively enumerate possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; and
determine one or more electrical digital signals representing natural numerals associated with particular ones of said enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals;
further comprising executing said instructions by said processor to exhaustively enumerate said possible component rooted partial subtrees of said tree by;
identifying one more subtrees coupled to a root node of said tree; and
exhaustively enumerating possible component rooted partial subtrees of the identified subtrees;
wherein said tree is represented as one or more electrical digital signals representing a composite natural numeral based, at least in part, on said association, and wherein the method further comprises executing said instructions by said processor to identify said one or more subtrees by factoring said composite natural numeral into one or more electrical digital signals representing natural numerals representative of subtrees;
wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values.
4 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
48 Claims
-
1. A method comprising:
-
executing instructions by a processor to; exhaustively enumerate possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; and determine one or more electrical digital signals representing natural numerals associated with particular ones of said enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals; further comprising executing said instructions by said processor to exhaustively enumerate said possible component rooted partial subtrees of said tree by; identifying one more subtrees coupled to a root node of said tree; and exhaustively enumerating possible component rooted partial subtrees of the identified subtrees; wherein said tree is represented as one or more electrical digital signals representing a composite natural numeral based, at least in part, on said association, and wherein the method further comprises executing said instructions by said processor to identify said one or more subtrees by factoring said composite natural numeral into one or more electrical digital signals representing natural numerals representative of subtrees; wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus comprising:
-
means, comprising an electronic computing device, for exhaustively enumerating possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; means, comprising said electronic computing device, for determining natural numerals associated with particular ones of said enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals; means, comprising said electronic computing device, for identifying one more subtrees coupled to a root node of said tree; and means, comprising said electronic computing device, for exhaustively enumerating possible component rooted partial subtrees of said identified subtrees; wherein said tree is represented as a composite natural numeral based, at least in part, on said association, and wherein said means for identifying said one or more subtrees further comprises means for factoring said composite natural numeral into natural numerals representative of subtrees; wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. An apparatus comprising:
-
a computing platform, said computing platform comprising an electronic computing device programmed with instructions to; exhaustively enumerate possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; and determine one or more electrical digital signals representing natural numerals associated with particular ones of said enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals; wherein said electronic computing device is further programmed with instructions to; identify one or more subtrees coupled to a root node of said tree; and enumerate possible component rooted partial subtrees of said identified subtrees; wherein said tree is represented as one or more electrical digital signals representing a composite natural numeral based, at least in part, on said association, and wherein said electronic computing device is further programmed with instructions to identify said one or more subtrees by factoring said one or more signals representing said composite natural numeral into one or more electrical digital signals representing natural numerals representative of subtrees; wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36)
-
-
37. An article comprising:
-
a storage memory comprising machine-readable instructions which, in response to being executed by a processor, direct said processor to; exhaustively enumerate possible component rooted partial subtrees of a tree to model logical branches of a query, said component rooted partial subtrees defining respective connectable paths between a root node of the tree and nodes in respective component rooted partial subtrees along one or more edges in the tree; and determine natural numerals associated with particular ones of said exhaustively enumerated component rooted partial subtrees, said natural numerals being based, at least in part, on an association between trees and natural numerals; wherein said instructions, in response to being executed by said processor, further direct said processor to; identify one or more subtrees coupled to a root node of said tree; and exhaustively enumerate possible component rooted partial subtrees of said identified subtrees; wherein said tree is represented as a composite natural numeral based, at least in part, on said association, and wherein said instructions, in response to being executed by said processor, further direct said processor to identify said one or more subtrees by factoring said composite natural numeral into natural numerals representative of subtrees; wherein said tree comprises an edge or node labeled tree, and wherein the labels comprise discrete values. - View Dependent Claims (38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48)
-
Specification