Method and/or system for performing tree matching

Abstract

Embodiments of methods, apparatuses, devices and/or systems for performing tree matching are disclosed.

1 - 60 . (canceled) 
     
     
         61 . A method of performing tree matching comprising:
 executing instructions on one or more processors of one or more computing devices to:   subdivide a target tree and a query tree;   assign an individual and unique subdivided target tree numeral to at least one of subdivided target tree structures and assign an individual and unique subdivided query tree numeral to at least one of subdivided query tree structures, based at least in part on an association between trees and numerals, wherein the association between trees and numerals comprises to assign individual and unique numerals to associated and unique tree structures; and   match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral.   
     
     
         62 . The method of  claim 61 , wherein to assign the individual and unique subdivided target tree numeral to the at least one of the subdivided target tree structures comprises accessing a data structure stored in one or more physical memory devices to identify the individual and unique target tree numeral associated with the at least one of the subdivided target tree structures. 
     
     
         63 . The method of  claim 62 , wherein accessing the data structure stored in one or more physical memory devices to identify the individual and unique subdivided target tree numeral associated with the at least one of the subdivided target tree structures comprises performing a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures 
     
     
         64 . The method of  claim 61 , wherein assigning the individual and unique subdivided query tree numeral to the at least one of the subdivided query tree structures comprises accessing a data structure stored in one or more physical memory devices to identify the individual and unique query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         65 . The method of  claim 64 , wherein accessing the data structure stored in one or more physical memory devices to identify the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures comprises performing a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         66 . The method of  claim 61 , wherein to match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral further comprises to compare the individual and unique subdivided query tree numeral to the individual and unique subdivided target tree numeral to other tree numerals stored in the database to detect a presence of another tree numeral, wherein a correspondence between the another tree numeral and at least one of the individual and unique subdivided target tree numeral and the individual and unique query target tree numeral stored in the database is indicative of a presence of content in electronic content corresponding to the another tree numeral and is indicative of one or more locations thereof in the database. 
     
     
         67 . The method of  claim 61 , wherein the size of the individual and unique subdivided target tree numeral and the individual and unique subdivided query tree numeral in a number of bits does not exceed a number of bits in the numeral expressible within a platform native integer of fixed size for the one or more processors. 
     
     
         68 . The method of  claim 61 , and further comprising executing instructions on the one or more processors to:
 match another individual and unique subdivided query tree numeral with respect to another individual and unique subdivided target tree numeral.   
     
     
         69 . The method of  claim 61 , the query tree or the target tree comprising binary edge labeled trees (BELTs). 
     
     
         70 . The method of  claim 61 , the query tree or the target tree comprising a partial subtree. 
     
     
         71 . An article comprising:
 a non-transitory storage medium including executable instructions stored thereon; wherein the instructions are executable by one or more processors coupled to one or more physical memory devices;   wherein the one or more physical memory devices to store a database or portion thereof, and wherein the executable instructions to perform a tree matching operation on the database, or a portion thereof: and   wherein the tree matching instructions further to:   subdivide a target tree and a query tree;   assign an individual and unique subdivided target tree numeral to at least one of subdivided target tree structures and assign an individual and unique subdivided query tree numeral to at least one of subdivided query tree structures, based at least in part on an association between trees and numerals, wherein the association between trees and numerals comprises to assign individual and unique numerals to associated and unique tree structures; and   match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral.   
     
     
         72 . The article of  claim 71 , wherein the tree matching instructions to assign the individual and unique subdivided target tree numeral to the at least one of the subdivided target tree structures further comprise executable instructions to access a data structure stored in one or more physical memory devices to identify the individual and unique target tree numeral associated with the at least one of the subdivided target tree structures. 
     
     
         73 . The article of  claim 72 , wherein the tree matching instructions to access the data structure stored in one or more physical memory devices to identify the individual and unique subdivided target tree numeral associated with the at least one of the subdivided target tree structures further comprise executable instructions to perform a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures 
     
     
         74 . The article of  claim 71 , wherein the tree matching instructions to assign the individual and unique subdivided query tree numeral to the at least one of the subdivided query tree structures further comprise executable instructions to access a data structure stored in one or more physical memory devices to identify the individual and unique query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         75 . The article of  claim 74 , wherein the tree matching instructions to access the data structure stored in one or more physical memory devices to identify the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures further comprise executable instructions to perform a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         76 . The article of  claim 71 , wherein the tree matching instructions to match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral further comprise executable instructions to compare the individual and unique subdivided query tree numeral to the individual and unique subdivided target tree numeral to other tree numerals stored in the database to detect a presence of another tree numeral, wherein a correspondence between the another tree numeral and at least one of the individual and unique subdivided target tree numeral and the individual and unique query target tree numeral stored in the database is indicative of a presence of content in electronic content corresponding to the another tree numeral and is indicative of one or more locations thereof in the database. 
     
     
         77 . The article of  claim 71 , wherein the size of the individual and unique subdivided target tree numeral and the individual and unique subdivided query tree numeral in a number of bits does not exceed a number of bits in the numeral expressible within a platform native integer of fixed size for the one or more processors. 
     
     
         78 . The article of  claim 71 , the tree matching instructions further comprise executable instructions to match another individual and unique subdivided query tree numeral with respect to another individual and unique subdivided target tree numeral. 
     
     
         79 . The article of  claim 71 , wherein the target tree or the query tree to comprise binary edge labeled trees (BELTs). 
     
     
         80 . The article of  claim 71 , wherein the target tree or the query tree to comprise a partial subtree. 
     
     
         81 . An apparatus comprising:
 one or more processors coupled to one or more physical memory devices that store executable instructions and store binary digital signal quantities as physical memory states, wherein the executable instructions being accessible from the one or more physical memory devices for execution by the one or more processors; and   the one or more processors to store in at least one of the physical memory devices, binary signal quantities, if any, that are to result from execution of the instructions on the one or more processors, wherein the one or more physical memory devices also store a database or portion thereof, and wherein the executable instructions to perform a tree matching operation on the database, or the portion thereof; and   wherein the tree matching operation instructions further being executable to:   subdivide a target tree and a query tree;   assign an individual and unique subdivided target tree numeral to at least one of subdivided target tree structures and assign an individual and unique subdivided query tree numeral to at least one of subdivided query tree structures, based at least in part on an association between trees and numerals, wherein the association between trees and numerals comprises to assign individual and unique numerals to associated and unique tree structures; and   match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral.   
     
     
         82 . The apparatus of  claim 81 , wherein the tree matching instructions to assign the individual and unique subdivided target tree numeral to the at least one of the subdivided target tree structures further comprise executable instructions to access a data structure stored in one or more physical memory devices to identify the individual and unique target tree numeral associated with the at least one of the subdivided target tree structures. 
     
     
         83 . The apparatus of  claim 82 , wherein the tree matching instructions to access the data structure stored in one or more physical memory devices to identify the individual and unique subdivided target tree numeral associated with the at least one of the subdivided target tree structures further comprise executable instructions to perform a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures 
     
     
         84 . The apparatus of  claim 81 , wherein the tree matching instructions to assign the individual and unique subdivided query tree numeral to the at least one of the subdivided query tree structures further comprise executable instructions to access a data structure stored in one or more physical memory devices to identify the individual and unique query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         85 . The apparatus of  claim 84 , wherein the tree matching instructions to access the data structure stored in one or more physical memory devices to identify the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures further comprise executable instructions to perform a table look up operation to determine the individual and unique subdivided query tree numeral associated with the at least one of the subdivided query tree structures. 
     
     
         86 . The apparatus of  claim 81 , wherein the tree matching instructions to match the individual and unique subdivided query tree numeral with respect to the individual and unique subdivided target tree numeral further comprise executable instructions to compare the individual and unique subdivided query tree numeral to the individual and unique subdivided target tree numeral to other tree numerals stored in the database to detect a presence of another tree numeral, wherein a correspondence between the another tree numeral and at least one of the individual and unique subdivided target tree numeral and the individual and unique query target tree numeral stored in the database is indicative of a presence of content in electronic content corresponding to the another tree numeral and is indicative of one or more locations thereof in the database. 
     
     
         87 . The apparatus of  claim 81 , wherein the size of the individual and unique subdivided target tree numeral and the individual and unique subdivided query tree numeral in a number of bits does not exceed a number of bits in the numeral expressible within a platform native integer of fixed size for the one or more processors. 
     
     
         88 . The article of  claim 81 , the tree matching instructions further comprise executable instructions to match another individual and unique subdivided query tree numeral with respect to another individual and unique subdivided target tree numeral. 
     
     
         89 . The apparatus of  claim 71 , wherein the target tree or the query tree to comprise binary edge labeled trees (BELTs). 
     
     
         90 . The apparatus of  claim 71 , wherein the target tree or the query tree to comprise a partial subtree.