Skip to main content

A Path-Based Labeling Scheme for Efficient Structural Join

  • Conference paper

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

Abstract

The structural join has become a core operation in XML query processing. This work examines how path information in XML can be utilized to speed up the structural join operation. We introduce a novel approach to pre-filter path expressions and identify a minimal set of candidate elements for the structural join. The proposed solution comprises of a path-based node labeling scheme and a path join algorithm. The former associates every node in an XML document with its path type, while the latter greatly reduces the cost of subsequent element node join by filtering out elements with irrelevant path types. Comparative experiments with the state-of-the-art holistic join algorithm clearly demonstrate that the proposed approach is efficient and scalable for queries ranging from simple paths to complex branch queries.

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. http://www.ibiblio.org/xml/examples/shakespeare

  2. http://www.informatik.uni-trier.de/~ley/db/

  3. http://monetdb.cwi.nl/

  4. 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 ICDE, USA (2002)

    Google Scholar 

  5. Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of SIGMOD, USA (2002)

    Google Scholar 

  6. Chen, Y., Davidson, S.B., Zheng, Y.: BLAS: An Efficient XPath Processing System. In: Proceedings of SIGMOD, France (2004)

    Google Scholar 

  7. Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient Structural Joins on Indexed XML Documents. In: Proceedings of VLDB, China (2002)

    Google Scholar 

  8. Cohen, E., Kaplan, H., Milo, T.: Labelling Dynamic XML Tree. In: Proceedings of PODS, USA (2002)

    Google Scholar 

  9. Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A Fast Index for Semistructured Data. In: Proceedings of VLDB, Italy (2001)

    Google Scholar 

  10. Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: Proceedings of VLDB, Greece (1997)

    Google Scholar 

  11. Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: Indexing XML Data for Efficient Structural Joins. In: Proceedings of ICDE, India (2003)

    Google Scholar 

  12. Jiang, H., Wang, W., Lu, H.: Holistic Twig Joins on Indexed XML Documents. In: Proceedings of VLDB, Germany (2003)

    Google Scholar 

  13. Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proceedings of VLDB, Italy (2001)

    Google Scholar 

  14. Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Proceedings of ICDT, Israel (1999)

    Google Scholar 

  15. Rao, P., Moon, B.: PRIX: Indexing and Querying XML Using Prüfer Sequences. In: Proceedings of ICDE, USA (2004)

    Google Scholar 

  16. Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: Proceedings of SIGMOD, USA (2003)

    Google Scholar 

  17. Wu, X., Lee, M., Hsu, W.: A Prime Number Labelling Scheme for Dynamic Ordered XML Trees. In: Proceedings of ICDE, USA (2004)

    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

Li, H., Lee, M.L., Hsu, W. (2005). A Path-Based Labeling Scheme for Efficient Structural Join. In: Bressan, S., et al. Database and XML Technologies. XSym 2005. Lecture Notes in Computer Science, vol 3671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547273_4

Download citation

  • DOI: https://doi.org/10.1007/11547273_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28583-0

  • Online ISBN: 978-3-540-31968-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics