Performing a keyword search based on identifying exclusive lowest common ancestor (ELCA) nodes
US8086606B1 · kind B1 · utility
4Cited by
1References
13Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Jul 15, 2008 |
| Grant date | Dec 27, 2011 |
| Priority date | — |
| Expiry date | Feb 21, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/80
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.