Advertisement

Efficient Processing of XML Twig Pattern: A Novel One-Phase Holistic Solution

  • Zhewei Jiang
  • Cheng Luo
  • Wen-Chi Hou
  • Qiang Zhu
  • Dunren Che
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)

Abstract

Modern twig query evaluation algorithms usually first generate individual path matches and then stitch them together (through a “merge” operation) to form twig matches. In this paper, we propose a one-phase holistic twig evaluation algorithm based on the TwigStack algorithm. The proposed method applies a novel stack structure to preserve the holisticity of the twig matches. Without generating intermediate path matches, our method avoids the storage of individual path matches and the path merge process. Experimental results confirm the advantages of our approach.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 IEEE ICDE Conference, pp. 141–152. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  2. 2.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD Conference, pp. 310–321 (2002)Google Scholar
  3. 3.
    Chen, S., Li, H., Tatemura, J., Hsiung, W., Agrawal, D., Candan, K.: Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents. In: SIGMOD Conference, pp. 283–294 (2006)Google Scholar
  4. 4.
    Chen, T., Lu, J., Ling, T.W.: On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques. In: ACM SIGMOD international conference, pp. 455–466 (2005)Google Scholar
  5. 5.
    Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic Twig Joins on Indexe XML Documents. In: Proceedings of the 29th VLDB conference, pp. 310–321 (2003)Google Scholar
  6. 6.
    Lu, J., Chen, T., Ling, T.W.: Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach. In: Proceedings of CIKM, pp. 533–542 (2004)Google Scholar
  7. 7.
    Lu, J., Ling, T.W., Chan, C.-Y., Chen, T.: From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern. In: VLDB, pp. 193–204 (2005)Google Scholar
  8. 8.
    Polyzotis, N., Garofalakis, M., Ioannidis, Y.: Selectivity Estimation for XML Twigs. In: ICDE, pp. 264–275 (2004)Google Scholar
  9. 9.
    Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD, pp. 425–436 (2001)Google Scholar
  10. 10.
    Jiang, Z., Luo, C., Hou, W., Zhu, Q., Wang, C.-F.: An Efficient One-Phase Holistic Twig Join Algorithm for XML Data (2005), http://www.cs.siu.edu/~zjiang
  11. 11.
    Chen, S., Li, H., Tatemura, J., Hsiung, W., Agrawal, D., Candan, K.: Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queryies over XML Documents. In: VLDB, pp. 283–294 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Zhewei Jiang
    • 1
  • Cheng Luo
    • 1
  • Wen-Chi Hou
    • 1
  • Qiang Zhu
    • 2
  • Dunren Che
    • 1
  1. 1.Computer Science Department, Southern Illinois University Carbondale, Carbondale, IL 62901U.S.A.
  2. 2.Department of Computer and Info. Science, University of Michigan Dearborn, MI, 48128U.S.A.

Personalised recommendations