Advertisement

C-Tree Indexing for Holistic Twig Joins

  • Bo Ning
  • Chengfei Liu
  • Guoren Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5446)

Abstract

With the growing importance of semi-structure data in information exchange, effort has been put in providing an effective mechanism to match a twig query in an XML database. Bruno et al. have proposed a novel algorithm TwigStack to deal with the twig query pattern by scanning the tag streams only once. In this paper, we propose a new index called C-Tree and two algorithms named NestTwigStack and ADTwigStack to speed up the processing of twig pattern queries by omitting some elements that can be processed without scanning. Using C-Tree, our algorithms can accelerate both the ancestor-descendant and parent-child edges by skipping the elements with their context in documents. We complement our research with experiments on a set of real and synthetic data, which are intended to show the significant superiority of our algorithms over the previous algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal XML pattern matching. In: SIGMOD, pp. 310–321 (2002)Google Scholar
  2. 2.
    Florescu, D., Kossmann, D.: Storing and querying xml data using an rdmbs. IEEE Data Engineering Bulletin 22(3), 27–34 (1999)Google Scholar
  3. 3.
    Wu, Y., Patel, J.M., Jagadish, H.V.: Structural join order selection for XML query optimization. In: ICDE, pp. 443–454 (2003)Google Scholar
  4. 4.
    McHugh, J., Widom, J.: Query optimization for XML. In: VLDB, pp. 315–326 (1999)Google Scholar
  5. 5.
    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: ICDE, pp. 141–152 (2002)Google Scholar
  6. 6.
    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: SIGMOD, pp. 204–215 (2002)Google Scholar
  7. 7.
    Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-tree: Indexing XML data for efficient structural joins. In: ICDE, pp. 253–263 (2003)Google Scholar
  8. 8.
    Chen, T., Ling, T.W., Chan, C.Y.: Prefix path streaming: A new clustering method for optimal holistic XML twig pattern matching. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 801–810. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Lu, J., Chen, T., Ling, T.W.: TJFast: effective processing of XML twig pattern matching. In: WWW (Special interest tracks and posters), pp. 1118–1119 (2005)Google Scholar
  10. 10.
    University of Washington XML Repository, http://www.cs.washington.edu/research/xmldatasets/

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Bo Ning
    • 1
    • 2
  • Chengfei Liu
    • 1
  • Guoren Wang
    • 2
  1. 1.Swinburne University of TechnologyMelbourneAustralia
  2. 2.Northeastern UniversityShenyangChina

Personalised recommendations