Faster algorithms for searching relevant matches in XML databases

Authors:
Rung-Ren Lin;Ya-Hui Chang;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
Venue:
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Year:
2010

Citing 6
Cited 2

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
XSEarch: a semantic search engine for XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment

Identifying relevant matches with NOT semantics over XML documents

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Improving the performance of identifying contributors for XML keyword search

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

Keyword search is a friendly mechanism for the end user to identify interesting nodes in XML databases, and the SLCA (smallest lowest common ancestor)-based keyword search is a popular concept for locating the desirable subtrees corresponding to the given query keywords. However, it does not evaluate the importance of each node under those subtrees. Liu and Chen proposed a new concept contributor to output the relevant matches instead of all the keyword nodes. In this paper, we propose two methods, MinMap and SingleProbe, that improve the efficiency of searching the relevant matches by avoiding unnecessary index accesses. We analytically and empirically demonstrate the efficiency of our approaches. According to our experiments, both approaches work better than the existing one. Moreover, SingleProbe is generally better than MinMap if the minimum frequency and the maximum frequency of the query keywords are close.