Abstract
In this paper, we focus on efficient constructing of matched subtree (MSubtree) results for keyword queries on XML data. We firstly show that the performance bottlenecks for existing methods lie in (1) computing the set of relevant keyword nodes (RKNs) for each subtree root node, (2) constructing the corresponding MSubtrees, and (3) parallel execution. We then propose a two-step generic top-down subtree construction algorithm, which computes SLCA/ELCA nodes in the first step, and parallelly gets RKNs and generates MSubtree results in the second step, where generic means that (1) our method can be used to compute different kinds of subtree results, (2) our method is independent of the query semantics; top-down means that our method constructs each MSubtree by visiting nodes of the subtree constructed based on an RKN set level-by-level from left to right, such that to avoid visiting as many useless nodes as possible.
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
Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: Xrank: Ranked keyword search over xml documents. In: SIGMOD Conference (2003)
Kong, L., Gilleron, R., Lemay, A.: Retrieving meaningful relaxed tightest fragments for xml keyword search. In: EDBT, pp. 815–826 (2009)
Liu, Z., Chen, Y.: Reasoning and identifying relevant matches for xml keyword search. PVLDB 1(1), 921–932 (2008)
Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest lcas in xml databases. In: SIGMOD Conference (2005)
Zhou, J., Bao, Z., Chen, Z., Ling, T.W.: Fast result enumeration for keyword queries on XML data. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 95–109. Springer, Heidelberg (2012)
Zhou, J., Bao, Z., Wang, W., Ling, T.W., Chen, Z., Lin, X., Guo, J.: Fast slca and elca computation for xmlkeyword queries based on set intersection. In: ICDE (2012)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, J., Zhao, J., Wang, B., Zhao, X., Chen, Z. (2013). Efficient MSubtree Results Computation for XML Keyword Queries. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)