Exploit Sequencing to Accelerate XML Twig Query Answering

  • Qian Qian
  • Jianhua Feng
  • Jianyong Wang
  • Lizhu Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


Speeding up query evaluation in large XML repositories becomes a challenging and all-important problem with vast XML-related applications arising. In this paper, we present SCALER, an efficient algorithm for XML query answering based on UDFTS and effective twig structure matching scheme. UDFTS not only constructs a one-to-one correspondence between trees and sequences but also maintains critical parent-child relationships for twig structure matching. With SCALER, XML queries can be performed by subsequence matching without breaking twigs into sub paths and evaluating these paths individually. Thus, costly join operations can be avoided elegantly. We also show the correctness of query answering by eliminating false dismissals and false alarms naturally in SCALER. By a thorough experimental study on various real-life data, we prove the efficiency and scalability of SCALER over the previous known alternative.


Query Answer Query Answering Valid Subsequence Twig Pattern Twig Query 
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: ICDE (2002)Google Scholar
  2. 2.
    Alstrup, S., Rauhe, T.: Improved labeling scheme for ancestor queries. In: Proc. ACM SIAM Symposium on Discrete Algorithms (SODA) (2002)Google Scholar
  3. 3.
    Berglund, A., Boag, S., Chamberlin, D., Fernandez, M.F., Kay, M., Robie, J., Simon, J.: XML path language(XPath)2.0 W3c working draft 16. World Wide Web Consortium (August 2002)Google Scholar
  4. 4.
    Boag, S., Chamberlin, D., Fernandez, M.F., Florescu, D., Robie, J., Simon, J.: XQuery 1.0: An XML Query Language W3c working draft 16. World Wide Web Consortium (August 2002)Google Scholar
  5. 5.
    Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E.: Extensible markup language (XML)1.0, 2nd edn., W3C recommendation.WorldWide Web Consortium (October 2000)Google Scholar
  6. 6.
    Bruno, N., et al.: Holistic twig joins: Optimal XML pattern matching. In: SIGMOD (2002)Google Scholar
  7. 7.
    Zhang, C., Naaghton, J., DeWitt, D., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD (2001)Google Scholar
  8. 8.
    Chen, Q., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: SIGMOD 2003 (2003)Google Scholar
  9. 9.
    Chien, S.Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: VLDB 2002 (2002)Google Scholar
  10. 10.
    Chung, C., Min, J., Shim, K.: APEX: An adaptive path index for XML data. In: SIGMOD 2002 (2002)Google Scholar
  11. 11.
    Cooper, B.F., Sample, N., Franklin, M., Hjaltason, G., Shadmon, M.: A fast index for semistructured data. In: VLDB, pp. 341–350 (September 2001)Google Scholar
  12. 12.
    Feng, J., Qian, Q., Wang, J., Zhou, L.: Exploit Sequencing to Accelerate Hot XML Query Pattern Mining. In: ACM SAC (2006)Google Scholar
  13. 13.
    Feng, J., Li, G., Zhou, L., Ta, N., Qian, Q., Liao, Y.: BBTC: A New Update-supporting Coding Scheme for XML Documents. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: VLDB (1997)Google Scholar
  15. 15.
    Grust, T.: Accelerating XPath location steps. In: SIGMOD 2002 (2002)Google Scholar
  16. 16.
    He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: ICDE 2004 (2004)Google Scholar
  17. 17.
    Tatarinod, I.,, S.D.: Storing and querying ordered XML using a relational database system. In: SIGMOD 2002 (2002)Google Scholar
  18. 18.
    Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE 2002 (2002)Google Scholar
  19. 19.
    Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD 2002 (2002)Google Scholar
  20. 20.
    Ley, M.: DBLP database web site (2000),
  21. 21.
    Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB 2001 (2001)Google Scholar
  22. 22.
    Milo, T., Suciu, D.: Index structures for path expression. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, Springer, Heidelberg (1998)Google Scholar
  23. 23.
    Dietz, P.F.: Maintaining order in a linked list. In: The 14th Annual ACM Symp on Theory of Computing, San Francisco (1982)Google Scholar
  24. 24.
    Picciotto, S.: How to Encode a Tree. PhD thesis, University of California, San Diego (1999)Google Scholar
  25. 25.
    Rao, P., Moon, B.: PRIX: Indexing and querying XML using prüfer sequences. In: ICDE 2004 (2004)Google Scholar
  26. 26.
    Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: SIGMOD 2003 (2003)Google Scholar
  27. 27.
    Wang, H., Meng, X.: On the sequencing of Tree structures for XML indexing. In: ICDE 2005 (2005)Google Scholar
  28. 28.
    Wang, W., Jiang, H., Lu, H., Yu, J.X.: PBiTree coding and efficient processing of containment joins. In: ICDE 2003 (2003)Google Scholar
  29. 29.
    XMARK: The XML-benchmark project (2002),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Qian Qian
    • 1
  • Jianhua Feng
    • 1
  • Jianyong Wang
    • 1
  • Lizhu Zhou
    • 1
  1. 1.Deptartment of Computer Science and TechnologyTsinghua UniversityBeijingP.R. China

Personalised recommendations