US20210149860A1

US20210149860A1 - Manipulating sets of hierarchical data

Info

Publication number: US20210149860A1
Application number: US17/158,804
Authority: US
Inventors: Jack J. Letourneau
Original assignee: Individual
Current assignee: Lower48 IP LLC
Priority date: 2004-02-09
Filing date: 2021-01-26
Publication date: 2021-05-20
Also published as: US20110320499A1; US20200218707A1; US9177003B2; US11204906B2; US10255311B2; US20190171628A1; US8037102B2; US20210349871A1; US20160162528A1; US20050187900A1

Abstract

Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Description

This disclosure claims priority pursuant to 35 USC 119(e) from U.S. provisional patent application Ser. No. 60/543,371, filed on Feb. 9, 2004, by J. J. LeTourneau, titled “MANIPULATING SETS OF HIERARCHICAL DATA,” assigned to the assignee of the presently claimed subject matter.

BACKGROUND

This disclosure is related to hierarchical data arrangements and, more particularly, to manipulating such data arrangements.
In a variety of fields, data or a set of data, may be represented in a hierarchical fashion. This form of representation may, for example, convey information, such as particular relationships between particular pieces of data and the like. However, manipulating such data representations is not straight-forward, particularly where the data is arranged in a complex hierarchy. Without loss of generality, one example may include a relational database. Techniques for performing operations on such a database, for example, are computationally complex or otherwise cumbersome. A continuing need, therefore, exists for additional techniques for manipulating data hierarchies.

BRIEF DESCRIPTION OF THE DRAWINGS

Subject matter is particularly pointed out and distinctly claimed in the concluding portion of the specification. The claimed subject matter, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference of the following detailed description when read with the accompanying drawings in which:

FIG. 1 is a schematic diagram of one embodiment of a tree;

FIG. 2 is a schematic diagram illustrating one embodiment of a binary edge labeled tree;

FIG. 3 is a schematic diagram illustrating another embodiment of a binary edge labeled tree;

FIG. 4 is a schematic diagram illustrating an embodiment of a binary edge labeled string;

FIG. 5 is a table illustrating representations of binary strings and binary numerals that may be associated in one particular embodiment;

FIG. 6 is a table illustrating representations of binary strings that may be associated in one particular embodiment;

FIG. 7 is another table illustrating representations binary strings that may be associated in one particular embodiment;

FIGS. 8a, 8b, and 8c are a table illustrating a particular embodiment of an association between binary stings and binary edge labeled trees;

FIG. 9 is a table illustrating a portion of the Kleene enumeration of non-composite numerals;

FIG. 10 is a table illustrating one embodiment of a linear notation for representing a graphical depiction of a hierarchical set of data;

FIG. 11 is a schematic diagram of an embodiment of a node labeled tree;

FIGS. 12-17 illustrate application of various operations to convert the embodiment of FIG. 11 from one type of tree to another type of tree;

FIG. 18 is a schematic diagram illustrating another embodiment of a node labeled tree;

FIGS. 19-22 illustrate application of various operations to convert the embodiment of FIG. 18 from one type of tree to another type of tree; and

FIG. 23 is a schematic diagram illustrating one embodiment of a technique for combining binary strings.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the claimed subject matter. However, it will be understood by those skilled in the art that the claimed subject matter may be practiced without these specific details. In other instances, well-known methods, procedures, components and/or circuits have not been described in detail so as not to obscure the claimed subject matter.
Some portions of the detailed description which follow are presented in terms of algorithms and/or symbolic representations of operations on data bits or binary digital signals stored within a computing system memory, such as a computer memory. These algorithmic descriptions and/or representations are the techniques used by those of ordinary skill in the data processing arts to convey the substance of their work to others skilled in the art. An algorithm is here, and generally, considered to be a self-consistent sequence of operations and/or similar processing leading to a desired result. The operations and/or processing involve physical manipulations of physical quantities. Typically, although not necessarily, these quantities may take the form of electrical and/or magnetic signals capable of being stored, transferred, combined, compared and/or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals and/or the like. It should be understood, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels. Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing”, “computing”, “calculating”, “determining” and/or the like refer to the actions and/or processes of a computing platform, such as a computer or a similar electronic computing device, that manipulates and/or transforms data represented as physical electronic and/or magnetic quantities within the computing platform's memories, registers, and/or other information storage, transmission, and/or display devices.
In a variety of fields, data or sets of data may be represented in a hierarchical fashion. This form of representation may, for example, convey information, such as particular relationships between particular pieces of data and the like. However, manipulating such data representations is not straight forward, particularly where the data is arranged in a complex hierarchy. Without loss of generality, one example may include a relational data base. Techniques for performing operations on such a data base for example, may be computationally complex or otherwise cumbersome. A continuing need, therefore, exists for additional techniques for manipulating data hierarchies.
As previously discussed, in a variety of fields, it is convenient or desirable to represent data, a set of data and/or other information in a hierarchical fashion. In this context, such a hierarchy of data shall be referred to as a “tree.” In a particular embodiment, a tree may comprise a finite, rooted, connected, unordered, acyclic graph. This is illustrated here, for example, in FIG. 1 by embodiment 100. As illustrated, the root of this particular embodiment encompasses node 105. In addition to 105, there are eight other nodes designated 110 to 140, respectively. Likewise, the nodes are connected by branches referred to, in this context, as edges. Thus, the nodes of this tree are connected by eight edges. This embodiment, therefore, illustrates a finite tree that is rooted by node 105. Furthermore, the nodes are connected, meaning, in this context, that a path exists between any two nodes of the tree. The tree is likewise acyclic, meaning here, that no path in the tree forms a complete loop. Here, unordered refers to the notion that there is no implied ordering or precedence among nodes attached to a common node, despite the appearance of ordering in a graphical illustration.
As previously suggested, in a variety of contexts, it may be convenient and/or desirable to represent a hierarchy of data and/or other information using a structure, such as the embodiment illustrated in FIG. 1. One particular embodiment, without loss of generality, of a tree may include edges that are labeled with data and/or other values. Likewise, in one particular embodiment, such data or values may be limited to binary data, that is, in this example, either a binary one or a binary zero. Here, such an embodiment may be referred to as a binary edge labeled tree (BELT), as shall be discussed in more detail hereinafter.
One example of a BELT is illustrated by embodiment 200 of FIG. 2. Thus, as illustrated, the edges of the BELT shown in FIG. 2 are labeled with either a binary zero or binary one. FIG. 3 illustrates another embodiment 300 of a different binary edge labeled tree. It is noted that this tree is similar or isomorphic to the embodiment of FIG. 2.
A subset of BELTs may be referred to in this context as binary edge labeled strings (BELTs). One embodiment, 400, is illustrated in FIG. 4. Thus, as illustrated by embodiment 400, this particular binary edge labeled string comprises four nodes and three edges, where the edges are labeled, respectively, binary zero, binary one and binary zero. Thus, a binary edge labeled string comprises a binary edge labeled tree in which each node has no more than two edges. To reiterate, in this context, a string comprises a binary edge labeled string and a tree comprises a binary edge labeled tree if each edge of the string or tree respectively stores a single bit. Likewise, in this context, two nodes are employed to support an edge holding a single piece of binary data. At this point, it is worth noting that strings and trees having nodes and edges, such as previously described, may be represented in a computing platform or similar computing device through a data structure or a similar mechanism intended to capture the hierarchical relationship of the data. It is intended that all such embodiments are included within the scope of the claimed subject matter.
As may be apparent by a comparison of FIG. 4 with, for example, FIG. 2 or FIG. 3, typically a binary edge labeled tree has the ability to be richer and convey more data and/or more information than a binary edge labeled string, although, of course, depending on the particular tree and the particular string, there may be contrary examples, such as where the string is particularly large and the tree is particular small. The aspect of BELTs to be richer in information may be one potential motivation to employ BELTs over BELTs, for example.
Despite the prior observation, as shall be described in more detail hereinafter, an association may be made between any particular binary edge labeled string and a binary edge labeled tree or vice-versa, that is, between any particular binary edge labeled tree and a binary edge labeled string. In particular, as shall be explained in more detail hereinafter, an association may be constructed between binary edge labeled trees and binary edge labeled strings by enumerating in a consecutive order binary edge labeled strings and binary edge labeled trees, respectively, and associating the respectively enumerated strings and trees with natural numerals. Of course, as shall become more clear hereinafter, many embodiments of associations between trees and strings or between trees and natural numerals are possible. It is intended that the claimed subject matter include such embodiments.
In this context, it may be useful to draw a distinction between binary numerals or binary data values and binary strings. FIG. 5, for example, illustrates a binary string and its associated binary numeral or data value. All binary numerals or binary data values may be represented with a binary string, but not vice-versa. One reason for this is that all binary data values or numerals, except the binary data value zero, begin with a binary one, but not so for binary strings. Likewise, there are many different ways to represent binary strings, and the claimed subject matter is not limited to any particular technique to make such a representation. For example, FIG. 6 illustrates two techniques or approaches to viewing essentially or substantially the same binary string.
FIG. 6, therefore, has three columns. Column two contains the conventional or standard method to represent a binary string, such as may be employed in the field of computer science, for example. Along the same row, column three contains a graphical representation of substantially the same binary string using a binary edge labeled string, such as previously described. Likewise, column one, along the same row, contains a natural numeral that corresponds to the particular binary string of the particular row.
However, this particular order of binary strings is not the typical order that is well-known and employed, for example, in technical fields, such as computer science and/or electrical engineering. Typically, for binary numerals, for example, to form the next consecutive binary numeral after one, a binary digit or bit is added to the right. For example, in an ordered sense, the binary numeral following binary numeral one, (1)₂, is the binary numeral one zero, (10)₂.
In contrast, for the table illustrated in FIG. 6, a binary digit or bit is added to the left; however, a similar convention of adding a binary zero before a binary one is employed. Thus, as one example, the binary string after the binary string, one <1>, is the binary string, zero zero <0,0>. Furthermore, this particular ordering or enumeration of binary strings begins with the string with no nodes, which, for this particular embodiment, is associated with the natural numeral zero and has a symbolic representation here that comprises a lambda (λ). In this context, this may be referred to as the empty binary string or zero node binary edge labeled string. Next in the enumeration is the binary string that comprises a single node and, therefore, holds no data. In this particular embodiment, this is associated with the natural number one, and is depicted by a graphical representation that comprises a single node. This is referred to here as the one node binary string. For higher positive natural numerals, as previously suggested, to represent a single bit for a binary edge labeled string, two nodes are employed.
One technique for converting from a particular binary string, such as in column two, for example, to the natural numerals in column one, includes inserting a binary numeral one in front of the binary string, and then converting the binary numeral one plus the binary digits of the binary string to a binary numeral. The natural numeral, corresponding to that binary numeral by converting from base two to base ten, provides the desired result. Thus, one embodiment of a method of enumerating a set of strings, in this case binary strings, includes positioning, at a location k, where k represents a positive natural numeral, a binary string such that the string comprises the binary numeral corresponding to k with the left most binary digit omitted. Again, as previously suggested and illustrated in FIG. 6, by column three, binary strings may be represented by binary edge labeled strings or BELS, although the claimed subject matter is not limited in scope in this respect.
As alluded to previously, there are many ways to represent binary strings and it is intended to include all such representations within the scope of the claimed subject matter. As simply one example, FIG. 7 illustrates yet another view of a binary string. Column two of FIG. 7 provides particular examples of binary node labeled strings, rather than binary edge labeled strings. Thus, as will be discussed in more detail hereinafter, binary edge labeled strings and binary node labeled strings may comprise nearly interchangeable representations of a binary string, although, again, other representations are also included within the scope of the claimed subject matter.
In addition to enumerating binary strings, which may be accomplished by adding a bit to the left, as previously described, in one embodiment, alternatively, if a set of specific binary strings are provided, those strings may be ordered. An embodiment of a method of ordering, such as for the previously described embodiment, includes proceeding longer strings with shorter strings. However, for ordering strings of the same length, such strings may be ordered by converting to their associated values, as previously described, by adding binary numeral one to the left of the string, and placing the associated values in conventional ascending numerical order.
Just as binary strings may be ordered and/or enumerated, likewise binary edge labeled trees may also be enumerated and/or ordered. This is illustrated, for example, in FIG. 8. In this particular table, two views or representations of binary strings are associated with a particular representation of binary edge labeled trees. It is noted that this particular figure also includes the associated natural numerals. The association of such numerals for this particular embodiment should be clear based at least in part on the prior description.
Thus, for this particular embodiment, although the claimed subject matter is not limited in scope in this respect, a method of enumerating a set of trees begins with enumeration of an empty binary edge labeled tree and a one node binary edge labeled tree, similar to the empty binary string and one node binary string, previously described. Thus, as for binary strings, here, the empty tree is associated with the natural numeral zero and has a symbolic representation as illustrated in FIG. 8a (circle). Likewise, the one node tree, which holds no data, is associated with the natural numeral one and has a graphical representation of a single node. For higher positive natural numbers, however, this embodiment of a method of enumerating a set of trees comprises positioning a tree at location k, k being a positive natural numeral greater than three, where k is the product of u and v, u and v comprising positive natural numerals greater than one, such that the tree is formed by a union of the trees at positions u and v. Likewise, for those locations that are not a product of other natural positive numerals greater than one, that is, for locations that comprise non-composite numerals, denoted here by j, for example, j being a positive natural number greater than one, a tree is positioned at location j such that the tree is formed by finding the first tree in the prior enumeration such that the binary edge labeled tree obtainable from this first tree by attaching a node to the particular tree as a new root node and labeling the edge between the new root node and the prior root node with a binary “0” label is not in the enumeration at some position lower than j; however, if the binary edge labeled tree obtainable from that first tree, as just described, is present in the enumeration with a binary “0” label for the new edge, but not with a binary “1” label, then the tree at position j is that tree with a binary “1” label for the new edge. This may be illustrated, for example in FIG. 8, as described in more detail below.
As illustrated, for this particular embodiment, and as previously described, the empty tree has zero nodes and is associated with the natural numeral zero. Likewise, the one node tree root comprises a single node and is associated with the natural numeral one. Thus, to obtain the tree at position two, a root node is attached and connected to the prior root node by an edge. Likewise, here, by convention, the edge is labeled with a binary zero. If, however, the tree formed by the immediately proceeding approach were present in the prior enumeration of trees, then a similar process embodiment is followed, but, instead, the new edge is labeled with a binary one rather than a binary zero. Thus, for example, in order to obtain the binary edge labeled tree for position three, a new root node is connected to the root node by an edge and that edge is labeled with a binary one.
Continuing with this example, to obtain the binary edge labeled tree for position four, observe that numeral four is the product of numeral two times numeral two. Thus, a union is formed at the root of two trees, where, here, each of those trees is associated with the positive natural numeral two. Likewise, to obtain the binary edge labeled tree for position five, begin with the binary edge labeled tree for position two and follow the previously articulated approach of adding a root and an edge and labeling it with a binary zero.
In this context, adding a root node and an edge and labeling it binary zero is referred to as a “zero-push” operation and adding a root node and an edge and labeling it binary one is referred to as a “one-push” operation. Based at least in part on the prior description, for this particular embodiment, it may now be demonstrated that if k is any positive natural numeral and a tree x is positioned at location k, then a non-composite numeral is associated with the zero-push of that tree and a non-composite numeral is associated with the one-push for that tree. Furthermore, the non-composite index of the zero-push of the tree comprises 2k−1, whereas the non-composite index of the one-push of the tree comprises 2k, where the index corresponds to the argument of the well-known Kleene enumeration on positive natural numerals of non-composite numerals, as illustrated, for example, in part in FIG. 9. Thus, referring again to FIG. 8, the one-push of the root tree is the tree at position three. This follows from FIG. 9 since P(2*1)=P(2)=3. Likewise, the tree at position five is the zero-push of the tree at position 2. Again, this follows from FIG. 9 since P(2*2−1)=P(3)=5.
In this context, the approach just described may be referred to as vectorizing non-composite numerals. In the embodiment just described, this was accomplished in pairs, although, of course, the claimed subject matter is not limited in scope in this respect. This may be accomplished in any number of numeral combinations, such as triplets, quadruplets, etc. Thus, using a quadruplet example, it is possible to construct trees such that if k is any positive natural numeral and a tree x is positioned at location k, then a non-composite numeral is associated with the zero-push of that tree, a non-composite numeral is associated with the one-push for that tree, a non-composite numeral is associated with the two-push for that tree, and a non-composite number is associated with the three-push for that tree. Furthermore, the index of the non-composite numeral is such that for a zero-push of the tree, the index comprises (4k−3), for a one-push of a tree, the index comprises (4k−2), for a two-push of a tree, the index comprises (4k−1), and for a three-push of a tree the index comprise (4k), where the index corresponds to the Kleene enumeration of non-composite numerals, P(index), such as provided in FIG. 9.
In the previously described enumeration of binary edged labeled trees, a mechanism may be employed to reduce or convert complex manipulations of hierarchical data to multiplication of natural numerals. For example, if it is desired to combine, or merge at their roots, two trees of hierarchical data, a complex task both computationally and graphically, instead, for this particular embodiment, the two trees may be converted to numerical data by using the previously described association embodiment between binary edge labeled trees and natural numerals. The resulting numerical data from the prior conversion may then be multiplied, and the resulting product may then be converted to a binary edge labeled tree by using a table look up of the previously described association embodiment. It is noted that a subtle distinction may be made between an enumeration embodiment and an association embodiment. Enumeration may comprise listing, in this example, a particular ordered embodiment of BELTs, whereas an association provides a relationship between, in this example, a particular ordered embodiment of BELTs and natural numerals. It is, of course, appreciated that many different enumeration and association embodiments may be employed to execute the operations discussed above and hereinafter, and the claimed subject matter is intended to cover all such enumeration and association embodiments.
Alternatively, a similar approach may be employed to combine two trees using binary strings, rather than numerical data. Thus, using the prior embodiment previously discussed in which particular binary strings and BELTs are associated, the BELTs may be converted to binary strings. The binary strings may be combined, and the resulting combination of strings may then be converted to a tree using the association embodiment, as described, for example, above. It is noted that in this particular context, combining binary strings refers to an operation as illustrated in FIG. 26. The binary strings are converted to binary numerals, such as previously described. The converted binary numerals may be multiplied, and the resulting binary numeral product may then be converted to a binary string, again, as previously described.
Likewise, a process embodiment that is a reversal to the previously described embodiments may also be employed. Thus, complex hierarchies of data may be split or divided, when this is desired. For example, a binary edge labeled tree to be divided may be converted to a piece of numerical data, such as by using the previously described association embodiment. This data may then be factored into two pieces of numerical data whose product produces the previously mentioned piece of numerical data. These two pieces of numerical data may then be converted to trees, again, by using the prior association embodiment, for example.
A similar approach may be employed using binary strings, analogous to the approach described above using binary strings to combine trees. Thus, a tree to be divided may be converted to a binary string using, for example, the previous association embodiment. This string may be split into two separate binary strings and these two separate binary strings may then be converted to two binary edge labeled trees, using the association embodiment previously discussed. Again, to do so, the binary string may be converted to a binary numeral. The binary numeral may then be factored into two binary numerals, and these two binary numerals may be converted to binary strings.
Another form of manipulating hierarchical sets of data may involve ordering or hashing. This may be desirable for any one of a number of different operations to be performed on the sets of data. One approach is similar to the previously described embodiment. For example, it may be desired to order a given set of trees. Doing so may involve converting the trees to numerical data, as previously described, using an association embodiment. The numerical data may then be ordered and the numerical data may then be converted back to binary edge labeled trees using the previously described association embodiment, or an alternate association embodiment, for example.
It is noted that there may be any one of a number of different ways of converting from numerals or numerical data values to a binary edge labeled tree or from a binary string to a binary edge labeled tree, and vice-versa. Nonetheless, a convenient method for doing so with this particular embodiment includes storing a table providing an association embodiment between natural numerals, binary strings and binary edge labeled trees, such as the embodiment previously described. Thus, once it is desired to convert from one to the other, such as from a binary string to a BELT, from a natural number to a BELT, or vice-versa, for example, a table look up operation may be performed using the association embodiment.
Techniques for performing table look ups are well-known and well-understood. Thus, this will not be discussed in detail here. However, it shall be appreciated that any and all of the previously described and/or later described processing, operations, conversions, transformations, manipulations, etc. of strings, trees, numerals, data, etc. may be performed on one or more computing platforms or similar computing devices, such as those that may include a memory to store a table as just described, although, the claimed subject matter is not necessarily limited in scope to this particular approach. Thus, for example, a hierarchy of data may be formed by combining two or more hierarchies of data, such as by applying a previously described embodiment. Likewise, multiple hierarchies of data may be formed by splitting or dividing a particular hierarchy of data, again, such as by applying a previously described embodiment. Likewise, additional operations and/or manipulations of data hierarchies may be performed, such as ordering hierarchies of data and more. It is intended that the claimed subject matter cover such embodiments.
Much of the prior discussion was provided in the context of binary edge labeled trees. Nonetheless, as alluded to previously, binary edge labeled trees and binary node labeled trees may be employed nearly interchangeably to represent substantially the same hierarchy of data. In particular, a binary node labeled tree may be associated with a binary edge labeled tree where the nodes of the binary node labeled tree take the same values as the edges of the binary edge labeled tree, except that the root node of the binary node labeled tree may comprise a node having a zero value or a null value. This is illustrated, for example, in FIG. 7. Thus, rather than employing binary edge labeled trees, the previously described embodiments may alternatively be performed using binary node labeled trees. As one example embodiment, operations and/or manipulations may be employed using binary edge labeled trees and then the resulting binary edge labeled tree may be converted to a binary node labeled tree. However, in another embodiment, operations and/or manipulations may be performed directly using binary node labeled trees where a different association embodiment, that is, in this example, one that employs binary node labeled trees, is employed.
In accordance with the claimed subject matter, therefore, any tree or any string, regardless of whether it is binary edge labeled, binary node labeled, non-binary, a feature tree, or otherwise, may be manipulated and/or operated upon in a manner similar to the approach of the previously described embodiments. Typically, different association embodiments shall be employed, depending at least in part, for example, upon the particular type of tree and/or string. For example, and as shall be described in more detail below in connection with FIG. 11, a node labeled tree in which the nodes are labeled with natural numerals or data values may be converted to a binary edge labeled tree. Furthermore, this may be accomplished with approximately the same amount of storage. For example, for this particular embodiment, this may involve substantially the same amount of node and/or edge data label values.
As previously noted, the claimed subject matter is not limited in scope to this particular example, however, as illustrated in more detail hereinafter, the tree illustrated in FIG. 11 is converted to a binary edge labeled tree through a sequence of processing depicted here as graph operations, although such a conversion may alternatively be implemented by operations implemented otherwise, one such example being a computing platform, for example. Alternatively, it may be desirable, depending upon the particular embodiment, to convert trees to, for example binary node labeled trees. Likewise, other embodiments in which trees of one form are converted to trees of another form are also included within the scope of the claimed subject. However, for this particular embodiment, it will be assumed that the association between trees and strings, such as previously described, is depicted or enumerated in terms of binary edge labeled trees, as previously illustrated, for example. Thus, in this example, a particular tree, embodiment 1100, is illustrated in FIG. 11, comprises a node labeled tree rather than an edge labeled tree.
Referring now to FIG. 11, node values are deleted for those nodes storing the value zero. This is illustrated, for example, in FIG. 12. Node values are also deleted for the nodes storing the value one. In this case, a new single unlabeled node is attached to those nodes that had stored the value one, and the edge between the prior node and the new node is labeled with a zero value. This is illustrated, for example, in FIG. 13. For nodes with a value k that is a power of 2, and larger than one, the node value is deleted and (log₂(k)+1) new nodes are attached, labeling the edge between the new nodes and the old nodes with a zero value. This, for example, is illustrated in FIG. 14.
The remaining node values comprise non-powers of two that are 3 or larger. These node values are factored into one or more non-composite numerals. For the resulting non-composite numerals, the non-composite numeral is replaced with the tag value of the index, for example, i, for the non-composite. For this particular embodiment, the term, tag value of index, i, for example, refers to a binary edge labeled tree in the previously discussed embodiment of a string-tree association that corresponds to a binary string associated with the binary numeral for i. The new edges of the tree are labeled with the binary value zero. This is illustrated, for example, in FIG. 15. The remaining edges of the tree are labeled with a binary value of one. This is illustrated in FIG. 16.
In another embodiment, however, a particular tree may include null types or, more particularly, some node values denoted by the empty set. This is illustrated, for example, by the tree in FIG. 17, although, of course, this is simply one example. An advantage of employing null types includes the ability to address a broader array of hierarchical data sets. For example, without loss of generality and not intending to limit the scope of the claimed subject matter in any way, a null type permits representing in a relational database, as one example, situations where a particular attribute does not exist. As may be appreciated, this is different from a situation, for example, where a particular attribute may take on a numeral value of zero. Thus, it may be desirable to be able to address both situations when representing, operating upon and/or manipulating hierarchical sets of data.
For this particular embodiment, a tree with nulls, as described above, may be converted to a tree without nulls. This shall be illustrated, for example, for nodes labeled with a null, such as for the tree in FIG. 17; however, the claimed subject matter is not limited in scope in this respect, of course. In this particular embodiment, the nulls are deleted from those nodes having a null. This is illustrated, for example, by FIG. 18.
Referring now to FIG. 19, node values are also deleted for those nodes storing the value zero. Furthermore, a single new node is attached to the nodes previously storing the zero values. The edge between the prior nodes and the new nodes are labeled with a zero value. For nodes with a value k that is a power of 2, including the value one, the node value is deleted and (log₂(k)+2) new nodes are attached, labeling the edge between the new nodes and the old nodes with a zero value. This is illustrated, for example, in FIG. 20.
The remaining node values comprise non-powers of two that are 3 or larger. These node values are factored into one or more non-composite numerals. For the resulting non-composite numerals, the non-composite numeral is replaced with the tag value of the index, for example, i, for the non-composite. For this particular embodiment, the term, tag value of index, i, for example, refers to a binary edge labeled tree in the previously discussed embodiment of a string-tree association that corresponds to a binary string associated with the binary numeral for i. The new edges are labeled with a binary value of zero. This is illustrated, for example, in FIG. 21. The remaining edges are labeled with a binary value of one. This tree is illustrated, for example, in FIG. 22.
Likewise, in an alternative embodiment, a node labeled tree may comprise fixed length tuples of numerals. For such an embodiment, such multiple numerals may be combined into a single numeral, such as by employing Cantor pairing operations, for example. See, for example, Logical Number Theory, An Introduction, by Craig Smorynski, pp, 14-23, available from Springer-Verlag, 1991. This approach should produce a tree to which the previously described embodiments may then be applied. Furthermore, for one embodiment, a tree in which nodes are labeled with numerals or numerical data, rather than binary data, may be converted to a binary edge labeled tree and/or binary node labeled tree, and, for another embodiment, a tree in which edges are labeled with numerals or numerical data, rather than binary data, may be converted to a binary edge labeled tree and/or binary node labeled tree.
Furthermore, a tree in which both the nodes and the edges are labeled may be referred to in this context as a feature tree and may be converted to a binary edge labeled tree and/or binary node labeled tree. For example, without intending to limit the scope of the claimed subject matter, in one approach, a feature tree may be converted by converting any labeled node with its labeled outgoing edge to an ordered pair of labels for the particular node. Using the embodiment described above, this tree may then be converted to a binary edge labeled tree.
In yet another embodiment, for trees in which data labels do not comprise simply natural numerals, such as, as one example, trees that include negative numerals, such data labels may be converted to an ordered pair of numerals. For example, the first numeral may represent a data type. Examples include a data type such as negative, dollars, etc. As described above, such trees may also be converted to binary edge labeled trees, such as by applying the previously described embodiment, for example.
A similar conversion exists for binary strings. In this context, therefore, depending upon the particular embodiment, for example, binary strings may be depicted as binary edge labeled strings, binary node labeled strings, and the like. Furthermore, for those embodiments in which labels are not binary, for example, a conversion may be made to a binary node labeled string and/or binary edge labeled string, for example. Alternatively, as described previously in connection with trees, depending on the particular embodiment, strings in these alternative forms (e.g., numerals versus binary data) may be manipulated and/or operated upon directly. Thus, in this context, when referring to an embodiment of an association, the association is meant to refer an association between strings and trees, where binary edge labeled strings and binary edge labeled trees are one particular embodiment. Thus, other embodiments may provide a similar type of association, however, such embodiments may alternative use binary node labels and the like. A similar proposition applies for association embodiments between natural numbers and strings and/or between natural numbers and trees. Thus, when referring to an embodiment of an association, the association is meant to refer a particular association between natural numerals and trees or between natural numerals and strings, where here binary edge labeled strings and binary edge labeled trees are one particular embodiment.
As previously described, trees may be employed to graphically represent a hierarchy of data or a hierarchy of a set of data. This has been illustrated in some detail for binary edge labeled trees, for example. As the previous figures, illustrate, however, such graphical hierarchical representations typically employ two spatial dimensions to depict the relationship among different pieces of data. This may be disadvantageous in some situations where a one dimensional representation or arrangement of symbols, such as is employed with alphabetic letters, for example, that are combined to create a linear collection of successive symbols or notations, such as words, would be more convenient.
FIG. 10 is a table that illustrates one particular embodiment of employing symbols, concatenated along one spatial dimension, here from left to right, by convention, to represent such a data hierarchy. The table includes four columns. The first column denotes natural numerals. The second column denotes binary strings, such as those are previously described. The third column denotes a one dimensional arrangement of symbols employed to represent the binary edge labeled trees for that particular position. Of course, as previously described in connection with prior embodiments, the claimed subject matter is not limited in scope to binary strings or binary edge labeled trees. Thus, in alternative embodiments, any tree may be represented with symbols organized in a one dimensional arrangement, as is demonstrated with this particular embodiment.
For this particular embodiment, the symbols are parsed to reduce redundancy of information. For this particular embodiment, the symbols #₀, and #₁are employed, to represent zero-push and one-push operations, respectively, although, of course, this is merely an embodiment. Any symbols may be employed, including, for example, symbols differentiated by color, symbols differentiated by shape, and the like.
A first symbol, such as for this particular embodiment, a “1,” may be employed to represent a node or an edge. For this particular embodiment, “1” represents a node. Additional symbols may be employed, in this particular embodiment, to represent labels of a node or an edge. Again, in this particular embodiment, for binary edge labeled trees, symbols are employed to represent labels of edges. Again, for this particular embodiment, two different labels are employed, a label for a binary one and a different label for a binary zero. Of course, “1” and “0” may be employed and another symbol may be employed to represent nodes in an alternative embodiment. However, using symbols other than “1” and “0” to represent binary one and binary zero reduces confusion with other typical and/or well-known binary numeral schemes.
Here, the linear or successive order of the symbols is employed to represent the graphical hierarchy. Thus, for a labeled edge, the label for that particular edge precedes the symbols that represent the nodes for the particular edge. As one example, consider the representation of the binary edge labeled tree associated with position two. As illustrated by FIG. 10 in comparison with FIG. 8, the label representing binary zero is provided immediately ahead of two adjacent symbols for nodes. The “1” immediately after the label represents the bottom node and the next “1” represents the root node. Thus, the number of “1”s represents the number of nodes for the particular binary edge labeled tree in this particular embodiment. The particular label therefore indicates here that the edge connecting the nodes is labeled binary zero. Likewise, a similar approach is employed for the representation of the tree for position three. Thus, the label of the edge connecting the two nodes comprises a binary one. In contrast, for the position for the binary edge labeled tree of position four, the first symbol represents the binary “0” label and the second symbol represents the bottom node for that edge. The other node for that particular edge is the root node. The symbols are then repeated, representing another edge labeled with a binary zero connected to the root node.
This above may be contrasted with the representation for position five of this association embodiment in which the labels for the edges are immediately adjacent each other and symbols for the nodes associated with the labeled edges are after the two adjacent label symbols. This indicates that the edges are connected to each other, as illustrated by the graphical representation of this particular binary edge labeled tree, rather than each being connected to the root note, as in the prior tree. Of course, the successive edges are then connected to the root node at the top, illustrated by the final “1” at position five. Thus, using this particular embodiment, it is possible to representation all binary edge labeled trees using three symbols going from left to right.
It will, of course, be understood that, although particular embodiments have just been described, the claimed subject matter is not limited in scope to a particular embodiment or implementation. For example, one embodiment may be in hardware, such as implemented to operate on a device or combination of devices, for example, whereas another embodiment may be in software. Likewise, an embodiment may be implemented in firmware, or as any combination of hardware, software, and/or firmware, for example. Likewise, although the claimed subject matter is not limited in scope in this respect, one embodiment may comprise one or more articles, such as a storage medium or storage media. This storage media, such as, one or more CD-ROMs and/or disks, for example, may have stored thereon instructions, that when executed by a system, such as a computer system, computing platform, or other system, for example, may result in an embodiment of a method in accordance with the claimed subject matter being executed, such as one of the embodiments previously described, for example. As one potential example, a computing platform may include one or more processing units or processors, one or more input/output devices, such as a display, a keyboard and/or a mouse, and/or one or more memories, such as static random access memory, dynamic random access memory, flash memory, and/or a hard drive, although, again, the claimed subject matter is not limited in scope to this example.
In the preceding description, various aspects of the claimed subject matter have been described. For purposes of explanation, specific numbers, systems and/or configurations were set forth to provide a thorough understanding of the claimed subject matter. However, it should be apparent to one skilled in the art having the benefit of this disclosure that the claimed subject matter may be practiced without the specific details. In other instances, well-known features were omitted and/or simplified so as not to obscure the claimed subject matter. While certain features have been illustrated and/or described herein, many modifications, substitutions, changes and/or equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and/or changes as fall within the true spirit of the claimed subject matter.

Claims

1-473. (canceled)

474. A method of merging at least a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy to yield a third complex two dimensional graphical hierarchy, at least one of the first, the second, or the third complex two dimensional graphical hierarchies being in the form of a labeled tree hierarchy that includes content from one or more databases, the method comprising:

accessing instructions from one or more physical memory devices for execution by one or more processors;

executing instructions accessed from the one or more physical devices by the one or more processors;

storing, in at least one of the physical memory devices, binary digital signal values resulting from having executed the instructions on the one or more processors, binary digital signal values comprising content for one or more databases, or a portion thereof;

wherein the accessed instructions are executable to merge complex two dimensional graphical hierarchies; and

wherein the executing the complex hierarchy merger instructions further comprising:

accessing from the one or more physical memory devices, a first symbol value corresponding to content from the one or more databases, or a portion thereof, to be included in the first complex two dimensional graphical hierarchy and a second symbol value corresponding to a portion of the second complex two dimensional graphical hierarchy;

combining the first symbol value and the second symbol value; and

forming the third complex two dimensional graphical hierarchy, or at least a portion thereof, based, at least in part on the combining the first symbol value and the second symbol value.

475. The method of claim 474, wherein the first and second symbol values comprise first and second alphanumerical symbol values, stored in the form of binary digital signal values.

476. The method of claim 474 wherein the executing the complex hierarchy merger instructions further comprises displaying the third complex two dimensional graphical hierarchy.

477. The method of claim 474, wherein the executing the complex hierarchy merger instructions further comprises storing the third complex two dimensional graphical hierarchy.

478. The method of claim 474, wherein the first and the second complex two dimensional graphical hierarchies comprise complex two dimensional hierarchies in the form of edge or node labeled trees.

479. The method of claim 477, wherein the first and/or second symbol values are based, at least in part, on a stored association between symbol values and labeled tree hierarchies.

480. The method of claim 479, wherein the stored association is implemented via a stored look up table.

481. The method of claim 474, wherein the one or more databases, or a portion thereof, comprises a relational database.

482. An apparatus to yield a third complex two dimensional graphical hierarchy based at least in part on a merger of a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy, at least one of the first, second, or third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content from one or more databases, the apparatus comprising:

one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital signal quantities as physical memory states, wherein the executable instructions being accessible from one or more physical memory devices for execution by the one or more processors;

the one or more processors able to store in at least one of the physical memory devices, binary digital signal quantities, if any, that are to result from execution of the instructions on the one or more processors, and the binary digital signal values comprising content for one or more databases, or a portion thereof, wherein the accessed instructions are to be executable to merge complex two dimensional graphical hierarchies; and

wherein the complex hierarchy merger instructions further to:

access, from the one or more physical memory devices, a first symbol value corresponding to content from the one or more databases, or a portion thereof, to be included in the first complex two dimensional graphical hierarchy and a second symbol value corresponding to at least a portion of the second complex two dimensional graphical hierarchy;

combine the first symbol value and the second symbol value; and

form the third complex two dimensional graphical hierarchy, or at least a portion thereof, based, at least in part, on the combination the first symbol value and the second symbol value.

483. The apparatus of claim 482, wherein the symbol values to comprise first and second alphanumerical symbol values to be stored in the form of binary digital signal values.

484. The apparatus of claim 482, wherein the complex hierarchy merger instructions further comprise instructions to display the third complex two dimensional graphical hierarchy.

485. The apparatus of claim 482, wherein the complex hierarchy merger instructions further comprise instructions to store the third complex two dimensional graphical hierarchy.

486. The apparatus of claim 482, wherein the first and the second complex two dimensional graphical hierarchies further to comprise complex two dimensional graphical hierarchies in the form of edge or node labeled trees.

487. The apparatus of claim 485, wherein the first and/or second symbol values are to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies.

488. The apparatus of claim 487, wherein the stored association is to be implemented via a stored look up table.

489. The apparatus of claim 482, wherein the one or more databases, or a portion thereof, to comprise a relational database.

490. An article comprising:

a non-transitory storage medium comprising instructions stored thereon, the instructions to be executable to yield a third complex two dimensional graphical hierarchy based at least in part on a merger of a first complex two dimensional graphical hierarchy and a second complex two dimensional graphical hierarchy, at least one of the first, second, and third complex two dimensional graphical hierarchies to be in the form of a labeled tree hierarchy that is to include content from one or more databases;

wherein the instructions are accessible from the non-transitory storage medium and stored as physical memory states on one or more physical memory devices, the one or more physical memory devices to be coupled to one or more processors able to execute the instructions stored as physical memory states, the one or more physical memory devices also to store binary digital signal quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors and wherein the binary digital signal values to comprise content for one or more databases; and

wherein the executable complex hierarchy merger instructions further to:

combine the first symbol value and the second symbol value; and

form the third complex two dimensional graphical hierarchy, or at least a portion thereof, based at least in part, on the combination of the first symbol value and the second symbol value.

491. The article of claim 490, wherein the first and second symbol values to comprise first and second alphanumerical symbol values, stored in the form of binary digital signal values.

492. The article of claim 490, wherein the complex hierarchy merger instructions further to display the third complex two dimensional graphical hierarchy symbol values.

493. The article of claim 490, wherein the complex hierarchy merger instructions further to store the third complex two dimensional graphical hierarchy.

494. The article of claim 490, wherein the first and the second complex two dimensional graphical hierarchies to comprise complex two dimensional hierarchies in the form of edge or node labeled trees.

495. The article of claim 493, wherein the first and second symbol values are to be based, at least in part, on a stored association between symbol values and labeled tree hierarchies.

496. The article of claim 495, wherein the stored association is to be implemented via a stored look up table.

497. The article of claim 490, wherein the one or more databases, or a portion thereof, to comprise a relational database.