Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Liu, Z., Chen, Y.: Reasoning and identifying relevant matches for xml keyword search. In: 34th International Conference on Very Large Data Bases (VLDB) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, L., Gilleron, R., Lemay, A. (2009). ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00887-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-00887-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00886-3
Online ISBN: 978-3-642-00887-0
eBook Packages: Computer ScienceComputer Science (R0)