Abstract
As more and more data are represented and stored by XML format, how to query XML data has become an increasingly important research issue. Keyword search is a proven user-friendly way of querying HTML documents, and it is well suited to XML trees as well. However, it is still an open problem in XML keyword retrieval that which XML nodes are meaningful and reasonable to a query, how to find these nodes effectively and efficiently. In recent years, many XML keyword retrieval models have been presented to solve the problem, such as XRANK and SLCA. These models usually return the most specific results and discard most ancestral nodes. There may not be sufficient information for users to understand the returned results easily. In this paper, we present a new XML keyword retrieval model, XTree, which can cover every keyword node and return the comprehensive result trees. For XTree model, we propose Xscan algorithm for processing keyword queries and GenerateTree for constructing results. We analytically and experimentally evaluate the performances of our algorithms, and the experiments show that our algorithms are efficient.
Supported by the National High-Tech Research and Development Plan of China under Grant No.2009AA01Z136.
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
Clark, J., DeRose, S.: XML Path Language (XPath) 1.0 (November 1999), http://www.w3.org/TR/xpath
XQuery 1.0: An XML Query Language (June 2001), http://www.w3.org/XML/Query
Shanmugasundaram, J., Tufte, K., Zhang, C., Gang, H., DeWitt, D.J., Naughton, J.F.: Relational databases for querying XML documents: Limitations and opportunities. In: VLDB (1999)
Kanne, C.C., Moerkotte, G.: Efficient Storage of XML Data. In: ICDE (2000)
Schmidt, A., Kersten, M.L., Windhouwer, M., Waas, F.: Efficient relational storage and retrieval of XML documents. In: Suciu, D., Vossen, G. (eds.) WebDB 2000. LNCS, vol. 1997, p. 137. Springer, Heidelberg (2001)
Cooper, B.F., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: Proc. A Fast Index for Semistructured Data. In: VLDB (2001)
Chien, S.Y., Vagena, Z., Zhang, D.H., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: VLDB (2002)
McHugh, J., Widom, J., Abiteboul, S., Luo, Q., Rajaraman, A.: Indexing Semistructured Data. Technical Report (1998)
Bohannon, P., Freire, J., Roy, P., Simeon, J.: From XML schema to relations: A cost-based approach to XML storage. In: ICDE (2002)
Cho, J., Rajagopalan, S.: A fast regular expression indexing engine. In: ICDE (2002)
Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked Keyword Search over XML Documents. In: Proceedings of SIGMOD, pp. 16–27 (2003)
Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: Proceedings of SIGMOD, pp. 527–538 (2005)
Liu, Z., Chen, Y.: Identifying Meaningful Return Information for XML Keyword Search. In: Proceedings of SIGMOD, pp. 329–340 (2007)
Xerces-C, http://xerces.apache.org/xerces-c/
Berkeley DB, http://www.oracle.com/technology/products/berkeley-db/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ji, CR., Deng, ZH., Xiang, YQ., Yu, H., Tang, SW. (2009). XTree: A New XML Keyword Retrieval Model. In: Chen, L., et al. Advances in Web and Network Technologies, and Information Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03996-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-03996-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03995-9
Online ISBN: 978-3-642-03996-6
eBook Packages: Computer ScienceComputer Science (R0)