Method and/or system for simplifying tree expressions such as for query reduction
First Claim
Patent Images
1. A method of using pattern matching on a complex tree expression of a complex tree hierarchy, the method comprising:
- forming another complex tree expression for a rooted partial subtree query using, at least in part, a plurality of operations usable for determining a one-to-one association between tree hierarchies and natural numerals;
forming the complex tree expression for the complex tree hierarchy using at least in part the plurality of operations usable for determining the one-to-one association between tree hierarchies and natural numerals;
reducing, using at least in part a plurality of algebraic expressions, the formed complex tree expression for the complex tree hierarchy into a plurality of interrelated portions; and
comparing the another complex tree expression for the rooted partial subtree query with the reduced plurality of interrelated portions for the complex tree expression.
4 Assignments
0 Petitions
Accused Products
Abstract
Embodiments of methods, apparatuses, devices and/or systems for simplifying tree expressions, such as for pattern matching, are disclosed.
270 Citations
56 Claims
-
1. A method of using pattern matching on a complex tree expression of a complex tree hierarchy, the method comprising:
-
forming another complex tree expression for a rooted partial subtree query using, at least in part, a plurality of operations usable for determining a one-to-one association between tree hierarchies and natural numerals; forming the complex tree expression for the complex tree hierarchy using at least in part the plurality of operations usable for determining the one-to-one association between tree hierarchies and natural numerals; reducing, using at least in part a plurality of algebraic expressions, the formed complex tree expression for the complex tree hierarchy into a plurality of interrelated portions; and comparing the another complex tree expression for the rooted partial subtree query with the reduced plurality of interrelated portions for the complex tree expression. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. An article comprising:
- a non-transitory storage medium, the storage medium having stored thereon instructions executable to;
form a complex tree expression for a complex tree hierarchy via use at least in part of a plurality of operations to determine a one-to-one association between tree hierarchies and natural numerals; form another complex tree expression for a rooted partial subtree query using, at least in part, the plurality of operations usable to determine a one-to-one association between tree hierarchies and natural numerals; reduce, via use at least in part of a plurality of algebraic expressions, the formed complex tree expression for the complex tree hierarchy into a plurality of interrelated portions; and compare the another complex tree expression for the rooted partial subtree query with the reduced plurality of interrelated portions for the complex tree expression. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
- a non-transitory storage medium, the storage medium having stored thereon instructions executable to;
-
29. An apparatus comprising:
-
means for forming a complex tree expression for a complex tree hierarchy using at least in part a plurality of operations usable for determining a one-to-one association between tree hierarchies and natural numerals; means for forming another complex tree expression for a rooted partial subtree query using, at least in part, the plurality of operations usable for determining the one-to-one association between tree hierarchies and natural numerals; means for reducing, using at least in part a plurality of algebraic expressions, the formed complex tree expression for the complex tree hierarchy into a plurality of interrelated portions; and means for comparing the another complex tree expression for the rooted partial subtree query with the reduced plurality of interrelated portions for the complex tree expression. - View Dependent Claims (30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42)
-
-
43. An apparatus comprising:
-
a computing device comprising one or more processors programmed with instructions executable to; form a complex tree expression for a complex tree hierarchy via use at least in part of a plurality of operations to determine a one-to-one association between tree hierarchies and natural numerals; form another complex tree expression for a rooted partial subtree query using, at least in part, the plurality of operations usable to determine the one-to-one association between tree hierarchies and natural numerals; reduce, via use at least in part of a plurality of algebraic expressions, the formed complex tree expression for the complex tree hierarchy into a plurality of interrelated portions; and compare the another complex tree expression for the rooted partial subtree query with the reduced plurality of interrelated portions for the complex tree expression. - View Dependent Claims (44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56)
-
Specification