Abstract
To date, query performance in XML databases remains a difficult problem. XML documents are often very large making fast access to nodes within document trees cumbersome for query processors. Many research teams have addressed this issue with efficient algorithms and powerful indexes, but XML systems still cannot perform at the same level as relational databases. In this paper, we present a metamodel, which enables us to efficiently solve relationships between nodes in an XML database using standard SQL. By implementing the metamodel presented here, one can turn any off-the-shelf relational database into a high performance XPath processor. We will demonstrate the significant improvement achieved over three leading databases, and identify where each database is strongest in relation to XPath query performance.
Funded by Enterprise Ireland Grant No. CFTD/07/201.
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
Al-Khalifa, S., Jagadish, H.V., Jignesh, M.P., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE, pp. 141–152 (2002)
Aznauryan, N.A., Kuznetsov, S.D., Novak, L.G., Grinev, M.N.: SLS: A Numbering Scheme for Large XML Documents. Programming and Computer Software 32(1), 8–18 (2006)
Barta, A., Consens, M.P., Mendelzon, A.O.: Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods. In: VLDB, pp. 133–144 (2005)
Bohmeand, T., Rahm, E.: Supporting Efficient Streaming and Insertion of XML Data in RDBMS. In: RDBMS. Proc. 3rd Int. Workshop Data Integration over the Web DIWeb 2004, pp. 70–81 (2004)
Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., Teubner, J.: MonetDB/XQuery: a fast XQuery processor powered by a relational engine. In: SIGMOD 2006: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pp. 479–490. ACM, New York (2006)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp. 310–321. ACM, New York (2002)
Noonan, C.: Pruning XML Trees for XPath Query Optimisation. Master’s thesis, School of Computing, Dublin City University (2007)
Computer Science Bibliography. Online Resource, http://dblp.uni-trier.de
Fomichev, A., Grinev, M., Kuznetsov, S.D.: Sedna: A Native XML DBMS. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 272–281. Springer, Heidelberg (2006)
Grust, T.: Accelerating XPath Location Steps. In: SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp. 109–120. ACM, New York (2002)
Grust, T.: Accelerating XPath Location Steps. In: SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp. 109–120. ACM, New York (2002)
Grust, T., Rittinger, J., Teubner, J.: Why off-the-shelf RDBMSs are better at XPath than you might expect. In: SIGMOD 2007: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pp. 949–958. ACM, New York (2007)
Grust, T., van Keulen, M., Teubner, J.: Staircase Join: Teach a Relational DBMS to Watch Its (axis) Steps. In: VLDB 2003: Proceedings of the 29th international conference on Very large data bases, VLDB Endowment, pp. 524–535 (2003)
Marks, G., Roantree, M.: Metamodel-Based Optimisation of XPath Queries. Technical report, Dublin City University (2009), http://www.computing.dcu.ie/~isg/publications/ISG-09-01.pdf
Meier, W.: Index-driven XQuery Processing in the eXist XML Database. In: XML Prague (2006)
O’Connor, M.F., Bellahsène, Z., Roantree, M.: An extended preorder index for optimising xPath expressions. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 114–128. Springer, Heidelberg (2005)
Qin, L., Yu, J.X., Ding, B.: TwigList: Make twig pattern matching fast. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 850–862. Springer, Heidelberg (2007)
Schmidt, A., Waas, F., Kersten, M., Carey, M.J., Manolescu, I., Busse, R.: XMark: A Benchmark for XML Data Management. In: VLDB ’02: Proceedings of the 28th international conference on Very Large Data Bases, VLDB Endowment, pp. 974–985 (2002)
XML Path Language 2.0. Online Resource, http://www.w3.org/TR/xpath20
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD 2001: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pp. 425–436. ACM, New York (2001)
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
Marks, G., Roantree, M. (2009). Metamodel-Based Optimisation of XPath Queries. In: Sexton, A.P. (eds) Dataspace: The Final Frontier. BNCOD 2009. Lecture Notes in Computer Science, vol 5588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02843-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02843-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02842-7
Online ISBN: 978-3-642-02843-4
eBook Packages: Computer ScienceComputer Science (R0)