Skip to main content

Accelerating XML Structural Join by Partitioning

  • Conference paper
Database and Expert Systems Applications (DEXA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3588))

Included in the following conference series:

Abstract

Structural join is the core part of XML queries and has a significant impact on the performance of XML queries, several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. We first extend the relationships between nodes to the relationships between partitions in the plane and get some observations. We then propose a new partition-based method P-Join for structural join. Based on P-Join, moreover, we present an enhanced partitioned-based spatial structural join algorithm PSSJ.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural joins: A primitive for efficient XML query pattern matching. In: Proceedings of ICDE 2002 (2002)

    Google Scholar 

  2. Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: Proceedings of VLDB 2002 (2002)

    Google Scholar 

  3. Dietz, P.F.: Maintaining order in a linked list. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982)

    Google Scholar 

  4. Grust, T.: Accelerating XPath location steps. In: Proceedings of SIGMOD 2002 (2002)

    Google Scholar 

  5. Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: Indexing XML data for efficient stuctural join. In: Proceedings of ICDE 2003 (2003)

    Google Scholar 

  6. Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: Proceedings of VLDB 2001 (2001)

    Google Scholar 

  7. Wang, G., Liu, M.: Query processing and optimization for regular path expressions. In: Proceedings of the 12th International Conference on Advanced Information Systems Engineering (2003)

    Google Scholar 

  8. Wang, G., Lu, H., Yu, G., Bao, Y.: managing very large document collections using semantics. Journal of Comput. Sci. & Technol. 18(3), 403–406 (2003)

    Article  Google Scholar 

  9. Wang, G., Sun, B., Lv, J., Yu, G.: Rpe query processing and optimization techniques for xml databases. Journal of Comput. Sci. & Technol. 19(2), 224–237 (2004)

    Article  Google Scholar 

  10. Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: Proceedings of SIGMOD 2001 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, N., Yu, J.X., Wong, KF., Lü, K., Li, J. (2005). Accelerating XML Structural Join by Partitioning. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_28

Download citation

  • DOI: https://doi.org/10.1007/11546924_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28566-3

  • Online ISBN: 978-3-540-31729-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics