SYSTEM AND METHODS FOR SEARCHING DOCUMENTS IN A RELATIONAL DATABASE USING A TREE STRUCTURE STORED IN A TABULAR FORMAT
System and methods of searching documents in a relational database that includes receiving a search query from an application; identifying, via an ancestry table, node identifiers corresponding to the search query; determining, from the corresponding node identifiers, ancestor node identifiers having a depth value greater than zero; and displaying identifiers associated with the ancestor node identifiers to a user. Each entry in the ancestry table includes a node identifier, an ancestor node identifier associated with the node identifier and a depth value corresponding to a distance between the node identifier and the ancestor identifier.
1 . A method of searching documents in a relational database, comprising:
receiving a search query from an application,
identifying, via an ancestry table, node identifiers corresponding to the search query;
determining, from the corresponding node identifiers, ancestor node identifiers having a depth value greater than zero; and
displaying identifiers associated with the ancestor node identifiers to a user, wherein each entry in the ancestry table includes a node identifier; an ancestor node identifier associated with the node identifier; and a depth value corresponding to a distance between the node identifier and the ancestor identifier; and wherein at least one of the receiving, identifying, determining and displaying are performed by a processor.
2 . The method of claim 1 , wherein ancestry table corresponds to a file system structure.
3 . The method of claim 1 , wherein each of the node identifiers corresponds to one of a folder and document identifier in a file system.
4 . The method of claim 1 , wherein the ancestry table is stored in a non-transitory computer readable storage medium.
5 . A non-transitory computer-readable storage medium containing computer executable instructions to:
receive a search query from an application,
identify, via an ancestry table, node identifiers corresponding to the search query;
determine, from the corresponding node identifiers, ancestor node identifiers having a depth value greater than zero; and
display identifiers associated with the ancestor node identifiers to a user.
6 . The non-transitory computer-readable storage medium of claim 1 , further comprising an ancestry table wherein each entry in the ancestry table includes a node identifier; an ancestor node identifier associated with the node identifier; and a depth value corresponding to a distance between the node identifier and the ancestor identifier.
7 . A method of searching a tree structure having one or more nodes comprising:
receiving a search query from an application running on a computing device;
identifying, via an ancestry table, nodes matching the search query;
identifying, from the matching nodes, nodes having a depth value greater than zero;
using the identified nodes, identify corresponding ancestor nodes; and
outputting to the application an identity of the corresponding ancestor nodes.