Abstract
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.
The work was supported by the National Natural Science Foundation of China under Grant No.60573094, Tsinghua Basic Research Foundation under Grant No.JCqn2005022 and Zhejiang Natural Science Foundation under Grant No.Y105230.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Alstrup, S., Rauhe, T.: Improved labeling scheme for ancestor queries. In: Proc. ACM SIAM Symposium on Discrete Algorithms (SODA) (2002)
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)
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)
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)
Bruno, N., et al.: Holistic twig joins: Optimal XML pattern matching. In: SIGMOD (2002)
Zhang, C., Naaghton, J., DeWitt, D., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD (2001)
Chen, Q., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: SIGMOD 2003 (2003)
Chien, S.Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: VLDB 2002 (2002)
Chung, C., Min, J., Shim, K.: APEX: An adaptive path index for XML data. In: SIGMOD 2002 (2002)
Cooper, B.F., Sample, N., Franklin, M., Hjaltason, G., Shadmon, M.: A fast index for semistructured data. In: VLDB, pp. 341–350 (September 2001)
Feng, J., Qian, Q., Wang, J., Zhou, L.: Exploit Sequencing to Accelerate Hot XML Query Pattern Mining. In: ACM SAC (2006)
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)
Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: VLDB (1997)
Grust, T.: Accelerating XPath location steps. In: SIGMOD 2002 (2002)
He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: ICDE 2004 (2004)
Tatarinod, I.,, S.D.: Storing and querying ordered XML using a relational database system. In: SIGMOD 2002 (2002)
Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE 2002 (2002)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD 2002 (2002)
Ley, M.: DBLP database web site (2000), http://www.informatik.uni-trier.de/ley/db
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB 2001 (2001)
Milo, T., Suciu, D.: Index structures for path expression. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, Springer, Heidelberg (1998)
Dietz, P.F.: Maintaining order in a linked list. In: The 14th Annual ACM Symp on Theory of Computing, San Francisco (1982)
Picciotto, S.: How to Encode a Tree. PhD thesis, University of California, San Diego (1999)
Rao, P., Moon, B.: PRIX: Indexing and querying XML using prüfer sequences. In: ICDE 2004 (2004)
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)
Wang, H., Meng, X.: On the sequencing of Tree structures for XML indexing. In: ICDE 2005 (2005)
Wang, W., Jiang, H., Lu, H., Yu, J.X.: PBiTree coding and efficient processing of containment joins. In: ICDE 2003 (2003)
XMARK: The XML-benchmark project (2002), http://monetdb.cwi.nl/xml
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qian, Q., Feng, J., Wang, J., Zhou, L. (2006). Exploit Sequencing to Accelerate XML Twig Query Answering. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_21
Download citation
DOI: https://doi.org/10.1007/11733836_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)