Method and/or system for manipulating tree expressions

1. A method of arranging database content comprising:

manipulating one or more labeled complex two-dimensional graphical hierarchies, in which the one or more labeled complex two-dimensional graphical hierarchies comprise one or more labeled tree hierarchies;

wherein the method of arranging database content comprises:

executing instructions on one or more processors of one or more computing devices comprising:

converting a first labeled tree hierarchy in a first view to the first labeled tree hierarchy in a second view;

and

combining the first labeled tree hierarchy in the first view and the first labeled tree hierarchy in the second view to form a combined labeled tree hierarchy, wherein the first view is different from the second view.

2. The method of claim 1 , wherein the converting comprises accessing a data structure stored on one or more physical memory devices to identify one or more numerical signal values associated with the first labeled tree hierarchy in the first view.

3. The method of claim 2 , wherein the accessing the data structure stored on the one or more physical memory devices comprises performing a table look up operation to determine the one or more numerical signal values associated with the first labeled tree hierarchy in the first view.

4. The method of claim 1 , comprising comparing one or more numerical signal values associated with the first labeled tree hierarchy in the first view and one or more other numerical signal values stored in a database, or a portion thereof, to detect a presence of the one or more numerical signal values, wherein a correspondence is indicative of a presence of content stored in the database, or the portion thereof, corresponding to the one or more numerical signal values and is indicative of one or more locations thereof in the database, or the portion thereof.

5. The method of claim 1 , comprising generating an association between one or more labeled tree hierarchies and one or more numerical signal values;

wherein the generating the association comprises associating the first labeled tree hierarchy in the first view with at least one numerical signal value.

6. The method of claim 1 , wherein the one or more labeled tree hierarchies comprise one or more labeled tree hierarchies having one or more associated numerical signal values.

7. The method of claim 1 , wherein the one or more labeled tree hierarchies comprise one or more edge-labeled tree (ELT) hierarchies having one or more associated numerical signal values.

8. The method of claim 1 , wherein the one or more labeled tree hierarchies comprise one or more node-labeled tree (NLT) hierarchies having one or more associated numerical signal values.

9. The method of claim 1 , wherein the converting comprises associating the first labeled tree hierarchy in the first view and/or the first labeled tree hierarchy in the second view using one or more numerical signal values via a look up table.

10. The method of claim 1 , wherein the converting the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view comprises using one or more numerical signal values associated with the view of the first labeled tree hierarchy via a look up table.

11. An 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 are to be accessible from the one or more physical memory devices for execution by the one or more processors;

wherein the one or more processors are 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 are also to store a database, or a portion thereof, wherein the executable instructions are to arrange database content;

wherein the instructions to arrange database content are executable to:

convert a first labeled tree hierarchy in a first view to the first labeled tree hierarchy in a second view;

and

combine the first labeled tree hierarchy in the first view and the first labeled tree hierarchy in the second view to form a combined labeled tree hierarchy, wherein the first view is to be different from the second view.

12. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions to access a data structure in the database, or the portion thereof, to identify one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view.

13. The apparatus of claim 12 , wherein the instructions to access the data structure comprise executable instructions to perform a table look up operation to determine the one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view.

14. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions to compare one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view and one or more other numerical signal values to be stored in the database, or the portion thereof, to detect a presence of the one or more numerical signal values, wherein a correspondence is to be indicative of a presence of content in the database, or the portion thereof, to correspond to the one or more numerical signal values and is to be indicative of one or more locations thereof in the database, or the portion thereof.

15. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions to generate an association between the first labeled tree hierarchy and the combined labeled tree hierarchy and one or more numerical signal values;

wherein the executable instructions to generate the association comprise executable instructions to associate the first labeled tree hierarchy in the first view with at least one numerical signal value.

16. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more labeled tree hierarchies to have one or more associated numerical signal values.

17. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more edge-labeled tree (ELT) hierarchies to have one or more associated numerical signal values.

18. The apparatus of claim 11 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more node-labeled tree (NLT) hierarchies to have one or more associated numerical signal values.

19. The apparatus of claim 11 , wherein the instructions to convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view are executable to: associate the first labeled tree hierarchy in the first view and/or the first labeled tree hierarchy in the second view with one or more numerical signal values via a look up table.

20. The apparatus of claim 11 , wherein the instructions to convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view are executable to: convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view substantially in accordance with one or more numerical signal values associated with the view of the first labeled tree hierarchy via a look up table.

21. An article comprising: a non-transitory storage medium that includes executable instructions stored thereon; wherein the instructions are executable by one or more processors to be coupled to one or more physical memory devices;

wherein the one or more physical memory devices are to store a database, or a portion thereof, wherein the executable instructions are to arrange database content;

wherein the instructions to arrange database content are to:

convert a first labeled tree hierarchy in a first view to the first labeled tree hierarchy in a second view;

and

combine the first labeled tree hierarchy in the first view and the first labeled tree hierarchy in the second view to form a combined labeled tree hierarchy, wherein the first view is to be different from the second view.

22. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions to access a data structure in the database, or the portion thereof, to identify one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view.

23. The article of claim 22 , wherein the instructions to access the data structure comprise executable instructions to perform a table look up operation to determine the one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view.

24. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions to compare one or more numerical signal values to be associated with the first labeled tree hierarchy in the first view and one or more other numerical signal values to be stored in the database, or the portion thereof, to detect a presence of the one or more numerical signal values, wherein a correspondence is to be indicative of a presence of content in the database, or the portion thereof, to correspond to the one or more numerical signal values and is to be indicative of one or more locations thereof in the database, or the portion thereof.

25. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions to generate an association between the first labeled tree hierarchy and the combined labeled tree hierarchy and one or more numerical signal values;

wherein the executable instructions to generate the association are to comprise executable instructions to associate the first labeled tree hierarchy in the first-view with at least one numerical signal value.

26. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more labeled tree hierarchies to have one or more associated numerical signal values.

27. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more edge-labeled tree (ELT) hierarchies to have one or more associated numerical signal values.

28. The article of claim 21 , wherein the instructions to arrange database content comprise executable instructions so that the first labeled tree hierarchy and the combined labeled tree hierarchy are to comprise one or more node-labeled tree (NLT) hierarchies to have one or more associated numerical signal values.

29. The article of claim 21 , wherein the instructions to convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view are executable to: associate the first labeled tree hierarchy in the first view and/or the first labeled tree hierarchy in the second view with one or more numerical signal values via a look up table.

30. The article of claim 21 , wherein the instructions to convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view are executable to: convert the first labeled tree hierarchy in the first view to the first labeled tree hierarchy in the second view substantially in accordance with one or more numerical signal values associated with the view of the first labeled tree hierarchy via a look up table.