Efficient Data Structure for XML Keyword Search

Authors:
Ryan H. Choi;Raymond K. Wong
Affiliations:
The University of New South Wales, Sydney, Australia and National ICT Australia, Sydney, Australia;The University of New South Wales, Sydney, Australia and National ICT Australia, Sydney, Australia
Venue:
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Year:
2009

Citing 9
Cited 0

XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPRESS: a queriable compression for XML data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Multiway SLCA-based keyword search in XML data

Proceedings of the 16th international conference on World Wide Web
Querying and maintaining a compact XML storage

Proceedings of the 16th international conference on World Wide Web
Identifying meaningful return information for XML keyword search

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient LCA based keyword search in XML data

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Performance of compressed inverted list caching in search engines

Proceedings of the 17th international conference on World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a compression technique for inverted lists that are specifically designed for XML keyword search algorithms. In addition, we support all navigational operators required by such algorithms and these operators run faster than on traditional inverted lists. Our technique requires small memory footprint and consumption, thus it is also ideal for many resource constraint applications. Experiments show that our technique is efficient and scales well.