Abstract
There are a variety of structural indexes which have been proposed to speed up path expression queries over XML data. They usually work by partitioning nodes in the data graph into equivalence classes and storing equivalence classes as index nodes. The size of a structural index is never larger than the size of the data graph. In the literature it is not always mentioned that the basic structure of XML document is tree-structure. In prior work [1], we introduce and describe a new improved approach for query evaluation on XML data. We consider the data graph of an XML data as the union of the basic tree and the link graph. The basic tree is indexed, that improves the query evaluation more efficiently. In this paper, we introduce and describe a new approach combining two technics: structural- and tree structure indexes. The data graph is simulated by a strong 1-index, in which the basic tree structure remains. Moreover, tree structure index can be built on the new structural index in linear complexity with efficient algorithms. Our experiments show that the new combinational approach is more efficient than we just apply tree structure or structural indexes separately.
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
Kiss, A., Anh, V.L.: A solution for regular queries on XML Data. In: 5th Joint Conference on Mathematics and Computer Science (2004), Full paper at http://people.inf.elte.hu/leanhvu/papers/macs-abs.pdf
Buneman, P., Davidson, S., Hillebrand, G., Suciu, D.: A query language and optimization techniques for unstructured data. In: Proceedings of ACM-SIGMOD International Conference on Management of Data, pp. 505–516 (1996)
Buneman, P., Fernandez, M., Suciu, D.: UNQL: A query language and algebra for semi-structured data based on structural recursion. VLDB J. 9(1), 76–110 (2000)
McHugh, J., Abiteboul, S., Goldman, R., Quass, D., Widom, J.: The Lorel query language for semi-structured data. International Journal on Digital Libraries, 68–88 (1997)
McHugh, J., Widom, J.: Query optimization for xml. In: Proceedings of VLDB, Edinburgh, UK (September 1999)
Deutsch, A., Fernandez, M., Florescu, D., Levy, A., Suciu, D.M.: A query language for xml. In: Proceedings of the Eights International World Wide Web Conference (WWW8), Toronto (1999)
Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE (2002)
Chen, Q., Lim, A., Ong, K.W.: D(K)-Index: An Adaptive structural Summary for Graph-Structured Data. In: ACM SIGMOD (2003)
He, H., Yang, J.: Multiresolution Indexing of XML for Frequent Queries. In: Proceedings of the 20th International Conference on Data Engineering (2004)
Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal of Computing 16, 973–988 (1987)
Buneman, P., Davidson, S.B., Fernandez, M.F., Suciu, D.: Adding Structure to Unstructured Data. In: Proceedings of the 6th International Conference on Database Theory, pp. 336–350 (1997)
XMark: The xml benmark project, http://monetdb.cwi.nl/xml/index.html
The apache xml project - Xerces Java Parsers, http://xml.apache.org/xerces-j/
XML Path Language (XPath) 2.0 (April 04 2005), http://www.w3.org/TR/xpath20/
XQuery 1.0: An XML Query Language (April 04 2005), http://www.w3.org/TR/xquery/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiss, A., Le Anh, V. (2005). Combining Tree Structure Indexes with Structural Indexes in Query Evaluation on XML Data. In: Eder, J., Haav, HM., Kalja, A., Penjam, J. (eds) Advances in Databases and Information Systems. ADBIS 2005. Lecture Notes in Computer Science, vol 3631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547686_19
Download citation
DOI: https://doi.org/10.1007/11547686_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28585-4
Online ISBN: 978-3-540-31895-8
eBook Packages: Computer ScienceComputer Science (R0)