Please use this identifier to cite or link to this item:
|Title:||Fast SLCA and ELCA computation for XML keyword queries based on set intersection|
|Citation:||Zhou, J., Bao, Z., Wang, W., Ling, T.W., Chen, Z., Lin, X., Guo, J. (2012). Fast SLCA and ELCA computation for XML keyword queries based on set intersection. Proceedings - International Conference on Data Engineering : 905-916. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2012.75|
|Abstract:||In this paper, we focus on efficient keyword query processing for XML data based on the SLCA and ELCA semantics. We propose a novel form of inverted lists for keywords which include IDs of nodes that directly or indirectly contain a given 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 previous methods by up to two orders of magnitude in many cases. © 2012 IEEE.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.