Abstract
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and value indices is large even for a small XML document with a simple structure, XML DBMSs must carefully choose which indices to build. In this paper, we propose a tool, called XIST, that can be used by an XML DBMS as an index selection tool. XIST exploits XML structural information, data statistics, and query workload to select the most beneficial indices. XIST employs a technique that organizes paths that evaluate to the same result into structure equivalence groups and uses this concept to reduce the number of paths considered as candidates for indexing. XIST selects a set of candidate paths and evaluates the benefit of an index for each candidate path on the basis of performance gains for non-update queries and penalty for update queries. XIST also recognizes that an index on a path can influence the benefit of an index on another path and accounts for such index interactions. We present an experimental evaluation of XIST and current XML index selection techniques, and show that the indices selected by XIST result in greater overall improvements in query response times.
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
Al-Khalifa, S., Jagadish, H., Koudas, N., Patel, J., Srivastava, D., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE, San Jose, CA (February 2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD, Madison,Wisconsin, pp. 310–321 (June 2002)
Chaudhuri, S., Narasayya, V.: An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server. In: VLDB, Athens, Greece, pp. 146–155 (September 1997)
Chaudhuri, S., Narasayya, V.: Auto Admin “What-If” Index Analysis Utitlity. In: SIGMOD, Seattle,Washington, pp. 367–378 (June 1998)
Chawathe, S., Chen, M., Yu, P.S.: On Index Selection Schemes for Nested Object Hierarchies. In: VLDB, Santiago, Chile, pp. 331–341 (September 1994)
Chen, Q., Lim, A., Ong, K.W.: D(K)-Index: An Adaptive Structural Summary for Graph- Structured Data. In: SIGMOD, San Diego, CA, pp. 134–144 (June 2003)
Chien, S.-Y., Tsotras, V.J., Zaniolo, C., Zhang, D.: Efficient Complex Query Support for Multiversion XML Documents. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 161–178. Springer, Heidelberg (2002)
Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: VLDB, Hong Kong, China, pp. 263–274 (2002)
Chung, C., Min, J., Shim, K.: APEX: An Adaptive Path Index for XML Data. In: SIGMOD, Madison, WI, pp. 121–132 (June 2002)
Dietz, P., Sleator, D.: Two Algorithms for Maintaining Order in a List. In: Proc. 19th Annual ACM Symp. on Theory of Computing (STOC 1987), San Francisco, California, pp. 365–372 (1987)
Dietz, P.F.: Maintaining Order in a Linked List. In: Proceedings of the Fourtheenth Annual ACM Symposium of Theory of Computing, San Francisco, California, pp. 122–127 (May 1982)
Grust, T.: Accelerating XPath Location Steps. In: SIGMOD, Madison, Wisconsin, pp. 109–120 (2002)
Bosak, J.: The Plays of Shakespeare in XML, http://metalab.unc.edu/bosak/xml/eg/shaks200.zip
Jagadish, H.V., Al-Khalifa, S., Chapman, A., Lakshmanan, L.V.S., Nierman, A., Paparizos, S., Patel, J.M., Niwatwattana, N., Srivastava, D., Wu, Y., Yu, C.: TIMBER: A Native XML Database. The VLDB Journal 11(4), 274–291 (2002)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering Indexes for Branching Path Expressions. In: SIGMOD, Madison, WI, pp. 133–144 (May 2002)
Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE, San Jose, CA, pp. 129–140 (February 2002)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB, Roma, Italy, pp. 361–370 (September 2001)
Ley, M.: The DBLP Bibliography Server, http://dblp.uni-trier.de/xml/
Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Proceedings of the International Conference on Database Teorey, Jerusalem, Israel, pp. 277–295 (January 1999)
Project T. A. X.: Xerces C++ Parser, http://xml.apache.org/xerces-c/index.html
Runapongsa, K., Patel, J.M., Bordawekar, R., Padmanabhan, S.: XIST: An XML Index Selection Tool, http://gear.kku.ac.th/krunapon/~research/xist.pdf
Schmidt, A., Wass, F., Kersten, M., Florescu, D., Manolescu, I., Carey, M., Busse, R.: An XML Benchmark Project. Technical report, CWI, Amsterdam, The Netherlands (2001), http://monetdb.cwi.nl/xml/index.html
Valduriez, P.: Join indices. ACM Trans. Database Syst. 12(2), 218–246 (1987)
Valentin, G., Zuliani, M., Zilio, D., Lohman, G., Skelley, A.: DB2 Advisor: An Optimizer Smart Enough to Recommend its Own Indexes. In: ICDE, pp. 101–110 (2000)
May, M.: The Mondial Database in XML, http://www.informatik.uni-freiburg.de/~may/Mondial/
Wu, Y., Patel, J., Jagadish, H.: Structural Join Order Selection for XML Query Optimization. In: ICDE, Bangalore, India, pp. 443–454 (2003)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Managment Systems. In: SIGMOD, Santa Barbara, California (May 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Runapongsa, K., Patel, J.M., Bordawekar, R., Padmanabhan, S. (2004). XIST: An XML Index Selection Tool. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds) Database and XML Technologies. XSym 2004. Lecture Notes in Computer Science, vol 3186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30081-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-30081-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22969-8
Online ISBN: 978-3-540-30081-6
eBook Packages: Springer Book Archive