TwigStackList ¬: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data

  • Tian Yu
  • Tok Wang Ling
  • Jiaheng Lu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called TwigStackList ¬, which is designed for efficient matching an XML twig pattern with negation. We show that TwigStackList ¬ can identify a large query class to guarantee the I/O optimality. Finally, we run extensive experiments that validate our algorithm and show the efficiency and effectiveness of TwigStackList ¬.


Output Node Path Query Query Node Head Element Twig Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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 ICDE, pp. 141–152 (2002)Google Scholar
  2. 2.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of SIGMOD, pp. 310–321 (2002)Google Scholar
  3. 3.
    Chen, T., Lu, J., Ling, T.W.: On boosting holism in XML twig pattern matching using structural indexing techniques. In: Proceedings of SIGMOD (2005)Google Scholar
  4. 4.
    Jiang, H., Lu, H., Wang, W.: Efficient processing of twig queries with or-predicates. In: Proceeding of SIGMOD, pp. 59–70 (2004)Google Scholar
  5. 5.
    Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins on indexed XML documents. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 273–284. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    Jiao, E., Ling, T.W., Chan, C.Y., Yu, P.S.: Pathstack¬: A holistic path join algorithm for path query with not-predicates on XML data. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    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
  8. 8.
    Lu, J., Ling, T.W., Chan, C.-Y., Chen, T.: From region encoding to extended dewey: On efficient processing of XML twig pattern matching. In: Proceeding of VLDB (2005)Google Scholar
  9. 9.
    Lu, J., Ling, T.W., Yu, T., Li, C., Ni, W.: Efficient processing of ordered XML twig pattern. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Rao, P., Moon, B.: PRIX: Indexing adnd quering XML using prüfer sequences. In: Proceedings of ICDE (2004)Google Scholar
  11. 11.
  12. 12.
    Wang, H., Meng, X.: On the sequencing of tree structures for XML indexing. In: Proceeding of ICDE, pp. 372–383 (2005)Google Scholar
  13. 13.
    Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A dynamic index mathod for querying XML data by tree structure. In: Proceedings of SIGMOD (2003)Google Scholar
  14. 14.
  15. 15.
  16. 16.
    Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: Proceedings of SIGMOD, pp. 425–436 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tian Yu
    • 1
  • Tok Wang Ling
    • 1
  • Jiaheng Lu
    • 1
  1. 1.School of ComputingNational University of SingaporeSingapore

Personalised recommendations