Efficient keyword search over data-centric XML documents

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We in this paper investigate keyword search over data-centric XML documents. We first present a novel method to divide an XML document into self-integrated subtrees, which are connected subtrees and can capture different structural information of the XML document. We then propose the meaningful self-integrated trees, which contain all the keywords and describe how the keywords are interrelated, to answer keyword search over XML documents. In addition, we introduce the B+-tree in-dex to accelerate the retrieval of those meaningful self-integrated trees. Moreover, to further enhance the performance of keyword search, we present Bloom Filter to improve the efficiency of generating those meaningful self-integrated trees. Finally, we conducted extensive experiments to evaluate the performance of our method, and the experimental results demonstrate that our method achieves high efficiency and outperforms the existing approaches significantly. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Li, G., Feng, J., Ta, N., & Zhou, L. (2007). Efficient keyword search over data-centric XML documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4505 LNCS, pp. 491–502). Springer Verlag. https://doi.org/10.1007/978-3-540-72524-4_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free