Abstract
Answering keyword queries on XML data has been extensively studied. Current XML keyword search solutions primarily focus on single query setting where queries are answered individually. In many applications for searching information such as jobs and publications, an application server often receives a large number of keyword queries in a short period of time and many of them may share common keywords. Therefore, answering keyword queries in batches will significantly enhance the performance of these applications. In this paper, we investigate efficient approaches for computing multiple XML keyword queries. We first propose an approach that maximizes the sharing among keyword queries. We then consider useful data information and propose two data-aware algorithms: a short eager algorithm and a log based optimal algorithm. We evaluate the proposed algorithms on real and synthetic datasets and the experimental results demonstrate their efficiencies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The dblp xml record, http://dblp.uni-trier.de/xml/
The xmark xml record, http://www.xml-benchmark.org/index.html
Hummel, F.C., da Silva, A.S., Moro, M.M., Laender, A.H.F.: Multiple keyword-based queries over xml streams. In: CIKM, pp. 1577–1582 (2011)
Chen, L.J., Papakonstantinou, Y.: Supporting top-k keyword search in xml databases. In: ICDE, pp. 689–700 (2010)
Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: Xrank: Ranked keyword search over xml documents. In: SIGMOD Conference, pp. 16–27 (2003)
Jacob, M., Ives, Z.G.: Sharing work in keyword search over databases. In: SIGMOD Conference, pp. 577–588 (2011)
Koloniari, G., Pitoura, E.: Lca-based selection for xml document collections. In: WWW, pp. 511–520 (2010)
Li, J., Liu, C., Zhou, R., Wang, W.: Suggestion of promising result types for xml keyword search. In: EDBT, pp. 561–572 (2010)
Li, J., Liu, C., Zhou, R., Wang, W.: Top-k keyword search over probabilistic xml data. In: ICDE, pp. 673–684 (2011)
Liu, Z., Chen, Y.: Reasoning and identifying relevant matches for xml keyword search. PVLDB 1(1), 921–932 (2008)
Sun, C., Chan, C.Y., Goenka, A.K.: Multiway slca-based keyword search in xml data. In: WWW, pp. 1043–1052 (2007)
Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest lcas in xml databases. In: SIGMOD Conference, pp. 537–538 (2005)
Xu, Y., Papakonstantinou, Y.: Efficient lca based keyword search in xml data. In: EDBT, pp. 535–546 (2008)
Zhou, J., Bao, Z., Wang, W., Ling, T.W., Chen, Z., Lin, X., Guo, J.: Fast slca and elca computation for xml keyword queries based on set intersection. In: ICDE (2012)
Zhou, R., Liu, C., Li, J.: Fast elca computation for keyword queries on xml data. In: EDBT, pp. 549–560 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, L., Liu, C., Li, J., Zhou, R. (2013). Efficient Computation of Multiple XML Keyword Queries. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds) Web Information Systems Engineering – WISE 2013. WISE 2013. Lecture Notes in Computer Science, vol 8180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41230-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-41230-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41229-5
Online ISBN: 978-3-642-41230-1
eBook Packages: Computer ScienceComputer Science (R0)