Abstract
In this paper, we focus on the problem of effectively and efficiently answering XML keyword search. We first show the weakness of existing SLCA (Smallest Lowest Common Ancestor) based solutions, and then we propose the concept of Candidate Fragment. A Candidate Fragment is a meaningful sub tree in the XML document tree, which has the appropriate granularity. To efficiently compute Candidate Fragments as the answers of XML keyword search, we design Node Match Algorithm and Path Match algorithm. Finally, we conduct extensive experiments to show that our approach is both effective and efficient.
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.
Similar content being viewed by others
References
Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest LCAs in XML databases. In: SIGMOD, pp. 527–538 (2005)
Li, Y., Yu, C., Jagadish, H.V.: Enabling schema-free xquery with meaningful query focus. VLDB J. 17(3), 72–84 (2008)
Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRank: Ranked keyword search over xml documents. In: SIGMOD, pp. 16–27 (2003)
Li, G., Feng, J., Wang, J., Zhou, L.: Efficient keyword search for valuable LCAs over XML documents. In: CIKM, pp. 31–40 (2007)
Liu, Z., Chen, Y.: Identifying meaningful return information for XML keyword search. In: SIGMOD, pp. 329–340 (2007)
Sun, C., Chan, C.Y., Goenka, A.K.: Multiway SLCA-based keyword search in XML data. In: WWW, pp. 1043–1052 (2007)
Wang, W., Wang, X., Zhou, A.: Hash-search: An efficient SLCA-based keyword search algorithm on XML documents. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 496–510. Springer, Heidelberg (2009)
Xu, J., Lu, J., Wang, W., Shi, B.: Effective keyword search in XML documents based on MIU. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 702–716. Springer, Heidelberg (2006)
Li, J., Wang, J., Huang, M.: XKMis: Effective and Efficient Keyword Search in XML Databases. In: IDEAS, pp. 121–130 (2009)
Boncz, P., Grust, T., Keulen, M.: Pathfinder: XQuery - the relational way. In: VLDB, pp. 1322–1325 (2005)
Bao, Z., Ling, T.W., Chen, B., Lu, J.: Effective XML Keyword Search with Relevance Oriented Ranking. In: ICDE, pp. 517–528 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wen, Y., Zhang, H., Zhang, Y., Zhang, L., Xu, L., Yuan, X. (2011). Effective Keyword Search for Candidate Fragments of XML Documents. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds) Database Systems for Adanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20244-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-20244-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20243-8
Online ISBN: 978-3-642-20244-5
eBook Packages: Computer ScienceComputer Science (R0)