Skip to main content

Efficient Evaluation of XML Twig Queries

  • Conference paper
Advanced Web and Network Technologies, and Applications (APWeb 2006)

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

Included in the following conference series:

Abstract

With rapid acceptance of XML technologies, efficient query processing is a critical issue for XML repositories. In this paper, we consider the XML query which can be represented as a query tree with twig patterns. The proposed approach will first quickly retrieve data satisfying fragment paths which consist of only the parent-child relationship, and deal with the ancestor-descendent constraint in the later gluing stage. This approach focuses on where the data need to be “glued” and thus is very efficient. We conduct several experiments to evaluate the performance of the proposed approach. The results show that our system is more efficient than the holistic approach.

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 efiicient xml query pattern matching. In: Proceedings of the ICDE Conference (2002)

    Google Scholar 

  2. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal xml pattern matching. In: Proceedings of the ACM SIGMOD conference (2002)

    Google Scholar 

  3. Chen, Z., Jagadish, H.V., Lakshmanan, L.V.S., Paparizos, S.: From tree patterns to generalized tree patterns: On efficient evaluation of xquery. In: Proceedings of the 29th VLDB conference (2003)

    Google Scholar 

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

    Google Scholar 

  5. Diaz, A.L., Lovell, D.: Xml generator (1999), http://www.alphaworks.ibm.com/tech/xmlgenerator

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

    Google Scholar 

  7. McHugh, J., Widom, J.: Query optimization for xml. In: Proceedings of the 25th VLDB Conference (1999)

    Google Scholar 

  8. Yao, B.B., Ozsu, M.T., Keenleyside, J.: Xbench – a family of benchmarks for xml dbmss. In: Proceedings of EEXTT 2002 and DiWeb 2002 (2002)

    Google Scholar 

  9. Zhang, N., Kacholia, V., Tamer Ozsu, M.: A succinct physical storage scheme for efficient evaluation of path queries in xml. In: Proceedings of the IEEE ICDE conference (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, YH., Lee, CT., Luo, CC. (2006). Efficient Evaluation of XML Twig Queries. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_6

Download citation

  • DOI: https://doi.org/10.1007/11610496_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31158-4

  • Online ISBN: 978-3-540-32435-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics