Reasoning and identifying relevant matches for XML keyword search
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
This paper proposes a new effective filtering mechanism for pruning the uninteresting nodes implied in the SLCA-based (Smallest LCA --- Lowest Common Ancestor) fragments for XML keyword search. Its fundamental concept is the valid contributor. Given two nodes v and u , and u is v 's parent, the child v is a valid contributor to its parent u , if (1) v 's label is unique among all u 's children; or (2) for the siblings with same label as v , v 's content is not covered by any of them. The new filtering mechanism can be described as following: every node in each retrieved fragment should be valid contributor to its parent.