Performing a keyword search based on identifying exclusive lowest common ancestor (ELCA) nodes
First Claim
Patent Images
1. A computer comprising:
- a storage to store a hierarchical arrangement of nodes representing Extensible Markup Language (XML) data;
a processor responsive to a keyword search query containing query keywords to;
identify sets of nodes in the hierarchical arrangement for respective query keywords;
identify a smallest of the sets of nodes; and
starting with the smallest of the sets of nodes, apply a stack-based algorithm to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement.
1 Assignment
0 Petitions
Accused Products
Abstract
A hierarchical arrangement of nodes is provided to represent Extensible Markup Language (XML) data. In response to a keyword search query containing query keywords, sets of nodes in the hierarchical arrangement are identified for respective query keywords. A smallest of the sets of nodes is identified, and starting with the smallest of the sets of nodes, a stack-based algorithm is applied to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement.
13 Citations
13 Claims
-
1. A computer comprising:
-
a storage to store a hierarchical arrangement of nodes representing Extensible Markup Language (XML) data; a processor responsive to a keyword search query containing query keywords to; identify sets of nodes in the hierarchical arrangement for respective query keywords; identify a smallest of the sets of nodes; and starting with the smallest of the sets of nodes, apply a stack-based algorithm to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method, executed by a computer, of performing a keyword search in data stored within a storage in a hierarchical arrangement of nodes representing Extensible Markup Language (XML) data;
- the method comprising;
executing, by a processor in communication with said storage, a keyword search query containing query keywords to; identify sets of nodes in the hierarchical arrangement for respective query keywords; identify a smallest of the sets of nodes; and starting with the smallest of the sets of nodes, apply a stack-based algorithm to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement. - View Dependent Claims (7, 8, 9)
- the method comprising;
-
10. An article comprising at least one non-transitory computer-readable storage medium containing instructions for causing a computer to executa a method for performing a keyword search in data stored within a storage in a hierarchical arrangement of nodes representing Extensible Markup Language (XML) data, the method comprising:
executing, by a processor in communication with said storage, a keyword search query containing query keywords to; identify sets of nodes in the hierarchical arrangement for respective query keywords; identify a smallest of the sets of nodes; and starting with the smallest of the sets of nodes, apply a stack-based algorithm to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement. - View Dependent Claims (11, 12, 13)
Specification