Skip to main content

Efficient Queries on XML Data through Partitioning

  • Conference paper

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 8))

Abstract

The query evaluation algorithms of practically all XML management systems are based on structural joins, i.e., operations which determine all occurrences of parent/child, ancestor/descendant, preceding/following etc. relationships between node sets. In this paper, we present a simple method for accelerating structural joins which is very easy to implement on different platforms. Our idea is to split the nodes into disjoint partitions and use this information to avoid unnecessary structural joins. Despite its simplicity, our proposal can considerably accelerate XPath evaluation on different XML management systems. To exemplify this, we describe two implementation options of our method - one built from the scratch and one based on a relational database - and present the results of our experiments.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W3C (World Wide Web Consortium): Extensible Markup Language (XML) 1.0, http://www.w3c.org/TR/REC-xml/

  2. W3C (World Wide Web Consortium): XML Path Language (XPath) 2.0, http://www.w3c.org/TR/xpath20/

  3. W3C (World Wide Web Consortium): XQuery 1.0: An XML Query Language, http://www.w3c.org/TR/xquery/

  4. Grust, T.: Accelerating XPath Location Steps. In: Proceedings of the 2002 ACM SIGMOD Conference on Management of Data, pp. 109–120 (2002)

    Google Scholar 

  5. Krátký, M., Pokorný, J., Snášel, V.: Implementation of XPath Axes in the Multi-Dimensional Approach to Indexing XML Data. In: Proceedings of Current Trends in Database Technology, pp. 219–229 (2004)

    Google Scholar 

  6. Yoshikawa, M., Amagasa, T., Shimura, T., Uemura, S.: XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases. ACM Transactions on Internet Technology 1(1), 110–141 (2001)

    Article  Google Scholar 

  7. Peng, F., Chawathe, S.S.: XPath Queries on Streaming Data. In: Proceedings of the 2003 ACM SIGMOD Conference on Management of Data, pp. 431–442 (2003)

    Google Scholar 

  8. Barton, C., Charles, P., Goyal, D., Raghavachari, M., Fontoura, M., Josifovski, V.: Streaming XPath Processing with Forward and Backward Axes. In: Proceedings of the 19th International Conference on Data Engineering, pp. 455–466 (2003)

    Google Scholar 

  9. Fiebig, T., Helmer, S., Kanne, C.-C., Moerkotte, G., Neumann, J., Schiele, R., Westmann, T.: Natix: A Technology Overview. In: Web, Web-Services, and Database Systems, NODe 2002 Web and Database-Related Workshops, pp. 12–33 (2003)

    Google Scholar 

  10. Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the 18th International Conference on Data Engineering, pp. 141–152 (2002)

    Google Scholar 

  11. Luoma, O.: Supporting XPath Axes with Relational Databases Using a Proxy Index. In: Proceedings of the 3rd International XML Database Symposium, pp. 99–113 (2005)

    Google Scholar 

  12. Luoma, O.: Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases. In: Local Proceedings of the 10th East-European Conference on Advances in Databases and Information Systems, pp. 30–45 (2006)

    Google Scholar 

  13. Grust, T., van Keulen, M.: Tree Awareness for Relational RDBMS Kernels: Staircase Join. In: Intelligent Search on XML Data, Applications, Languages, Models, Implementations, and Benchmarks, pp. 231–245 (2003)

    Google Scholar 

  14. Tang, N., Yu, J.X., Wong, K.-F., Lü, K., Li, J.: Accelerating XML Structural Join by Partitioning. In: Proceedings of the 16th International Conference on Database and Expert Systems Applications, pp. 280–289 (2005)

    Google Scholar 

  15. Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering Indexes for Branching Path Queries. In: Proceedings of the 2002 ACM SIGMOD Conference on Management of Data, pp. 133–144 (2002)

    Google Scholar 

  16. Luoma, O.: A Structure-Based Filtering Method for XML Management Systems. In: Proceedings of the 15th International Conference on Database and Expert Systems Applications, pp. 401–410 (2004)

    Google Scholar 

  17. Dietz, P.F.: Maintaining Order in a Linked List. In: Proceedings of the 14th Annual Symposium on Theory of Computing, pp. 122–127 (1982)

    Google Scholar 

  18. Luoma, O.: Modeling Nested Relationships in XML Documents using Relational Databases. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science, pp. 259–268 (2005)

    Google Scholar 

  19. Luoma, O.: Efficient Methods for Storing and Querying XML Data with Relational Databases. PhD Thesis, University of Turku (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joaquim Filipe José Cordeiro

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luoma, O. (2008). Efficient Queries on XML Data through Partitioning. In: Filipe, J., Cordeiro, J. (eds) Web Information Systems and Technologies. WEBIST 2007. Lecture Notes in Business Information Processing, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68262-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68262-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68257-8

  • Online ISBN: 978-3-540-68262-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics