File(s) under permanent embargo
Fast SLCA and ELCA computation for XML keyword queries based on set intersection
conference contribution
posted on 2023-05-23, 08:58 authored by Zhou, J, Bao, Z, Wang, W, Ling, TW, Chen, Z, Lin, X, Guo, JIn this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which includes IDs of nodes that directly or indirectly contain the keyword. We propose a family of efficient algorithms that are based on the set intersection operation for both semantics. We show that the problem of SLCA/ELCA computation becomes finding a set of nodes that appear in all involved inverted lists and satisfy certain conditions. We also propose several optimization techniques to further improve the query processing performance. We have conducted extensive experiments with many alternative methods. The results demonstrate that our proposed methods outperform existing ones by up to two orders of magnitude in many cases.
History
Publication title
Proceedings of the IEEE 28th International Conference on Data EngineeringPagination
905-916ISBN
978-1-4673-0042-1Department/School
School of Information and Communication TechnologyPublisher
IEEEPlace of publication
United States of AmericaEvent title
IEEE 28th International Conference on Data EngineeringEvent Venue
Washington DC, USADate of Event (Start Date)
2012-04-01Date of Event (End Date)
2012-04-05Rights statement
Copyright 2012 IEEERepository Status
- Restricted