Efficiently identifying contributors for XML keyword search

Authors:
Ya-Hui Chang;Po-Hsien Chien;Yu-Kai Chang
Affiliations:
Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan;Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan;Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan
Venue:
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Year:
2012

Citing 8
Cited 0

XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Schema-free XQuery

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Effective keyword search for valuable lcas over xml documents

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient LCA based keyword search in XML data

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment
Fast ELCA computation for keyword queries on XML data

Proceedings of the 13th International Conference on Extending Database Technology
LCA-based selection for XML document collections

Proceedings of the 19th international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Keyword search is a friendly mechanism for users to obtain desired information in XML databases. Among all the research efforts on automatically reasoning the meaningful answers for users, the MaxMatch System [6] proposed the concept of contributor and has attracted a lot of attention. In this paper, we propose the TDPrune system to improve the efficiency of identifying contributors. It is mainly achieved by avoiding processing unnecessary nodes, and also by visiting nodes only once instead of twice. According to the experimental results, our TDPrune system usually outperforms the MaxMatch system, and the difference of execution time is sometimes by an order of magnitude.