Skip to main content
  • 1147 Accesses

Abstract

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. In this chapter, we present two kinds of join algorithms: XML structural join and XML holistic twig pattern processing. The structural join decomposes twig pattern into many binary relationships, which can be either parent–child or ancestor–descendant relationships, while holistic twig join processes the twig pattern as a whole, which has been proved more efficient. In addition, we showed two new streaming schemes: Tag+level scheme and Prefix-Path Streaming, which can provide optimal solutions for a larger class of twig patterns.

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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. 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 20th International Conference on Data Engineering, San Jose, pp. 141–152 (2002)

    Google Scholar 

  2. Bremer, J.M., Gertz, M.: An efficient XML node identification and indexing scheme. Technical Report CSE-2003-04, University of California at Davis (2003)

    Google Scholar 

  3. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. Technical Report, Columbia University (2002)

    Google Scholar 

  4. Carey, M.J., Dewitt, D.J., Franklin, M.J., Hall, N.E., Mcauliffe, M.L., Naughton, J.F., Schuh, D.T., SolomoN, M.H., Tan, C.K., Tsatalos, O.G., White, S.J., Zwilling, M.J.: Shoring up persistent applications. In: Proceedings of SIGMOD (1994)

    Google Scholar 

  5. Chen, T. Ling, T.W., Chan, C.Y.: Prefix path streaming: a new clustering method for optimal XML twig pattern matching. In: Proceedings of DEXA 2004, Zaragoza, pp. 801--811 (2004)

    Google Scholar 

  6. Chen, T., Lu, J., Ling, T.W.: On boosting holism in XML twig pattern matching using structural indexing techniques. In: Proceeding of the ACM SIGMOD International Conference on Management of Data, Baltimore (2005)

    Google Scholar 

  7. Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, pp. 134--144 (2003)

    Google Scholar 

  8. He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: Proceedings of ICDE 2004, Boston, pp. 683--694 (2004)

    Google Scholar 

  9. Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: Proceedings of SIGMOD 2002, Madison (2002)

    Google Scholar 

  10. Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for efficient indexing of paths in graph structured data. In: Proceedings of ICDE 2002, San Jose, pp. 129--140 (2002)

    Google Scholar 

  11. Lu, J., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: a look-ahead approach. In: CIKM, Washington, DC, pp. 533–542 (2004)

    Google Scholar 

  12. Lu, J., Ling, T.W., Chan, C., Chen, T.: From region encoding to extended Dewey: on efficient processing of XML twig pattern matching. In: Proceedings of 31th International Conference on Very Large Data Bases (VLDB), Trondheim, pp. 193–204 (2005)

    Google Scholar 

  13. Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proceedings of the 27th VLDB Conference, Rome, pp. 361–370, Sept 2001

    Google Scholar 

  14. Milo, T., Suciu, D.: Index structures for path expressions. In: Proceedings of ICDT 99, Jerusalem, pp. 277–295 (1999)

    Google Scholar 

  15. Tatarinov, I., Viglas, S., Beyer, K.S., Shanmugasundaram, J., Shekita, E.J., Zhang, C.: Storing and querying ordered XML using a relational database system. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Madison, pp. 204–215 (2002)

    Google Scholar 

  16. Wu, X., Lee, M., Hsu, W.: A prime number labeling scheme for dynamic ordered XML trees. In: Proceeding of ICDE, Boston, pp. 66–78 (2004)

    Google Scholar 

  17. Zhang, C., Naughton, J.F., Dewitt, D.J., Luo, Q, Lohman, G.M.: On supporting containment queries in relational database management systems. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Santa Barbara, pp. 425–436 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lu, J. (2013). XML Tree Pattern Processing. In: An Introduction to XML Query Processing and Keyword Search. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34555-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34555-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34554-8

  • Online ISBN: 978-3-642-34555-5

  • eBook Packages: Computer Science

Publish with us

Policies and ethics