Abstract
Extensible Markup Language (XML) has become a de facto standard for information representation and exchange over the Internet. The core operation of XML Query Processing is twig pattern matching, that is, finding in an XML document tree D all matches of a given twig query Q. Modern twig query matching algorithms often first decompose individual path matches and then merge them to form twig matches. In this paper, we review and evaluate two current efficient algorithms, namely HolisticTwigStack and TwigList. The HolisticTwigStack algorithm, which based on TwigStack, a notable and effective algorithm, uses a stack structure to avoid the storage of intermediate matches and the process of merging matches, whereas the TwigList algorithm use simple lists. Our analysis on experimental results show that the advantages and disadvantages of both HolisticTwigStack and TwigList for efficient XML Twig Pattern Matching in term of processing time and memory usage.
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
Berglund, A., Boag, S., Chamberlin, D., Fernadez, M.F., Kay, M., Robie, J., Simeon, J.: Xml path language (xpath). version 2.0 (2007), http://www.w3.org/TR?Xpath20/ , http://www.w3.org/TR/1999/REC-xpath-19991116
Boag, S., Chamberlin, D., Fernandez, M.F., Florescu, D., Robie, J., Simeon, J.: Xquery 1.0: An xml query language. W3C Recommendation (January 2007), http://www.w3.org/TR/2007/REC-xquery-20070123/
Qin, L., Yu, J.X., Ding, B.: Twiglist: Make twig pattern matching fast. In: Kotagiri, R., et al. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 850–862. Springer, Heidelberg (2007)
Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.S.: Twig2stack: Bottom-up processing of generalizedtree pattern queries over xml documents. In: VLDB 2006, September 2006, pp. 283–294. VLDB Endowment, Seoul (2006)
Jiang, Z., Luo, C., Hou, W.-C.: An efficient one-phase holistic twig join algorithm for xml data. In: CIKM 2006, pp. 786–787. ACM, New York (2006)
Bruno, N., Koudas, N., Srivastav, D.: Holistic twig joins: Optimal xml pattern matching. In: Proceedings of the 21st ACM SIGMOD International Conference Management of Data (SIGMOD 2002), pp. 310–321 (2002)
Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins on indexed xml documents. In: Proceedings of the 29th VLDB Conference, Germany, VLDB (2003)
Jiang, Z., Luo, C., Hou, W.-C., Zhu, Q., Che, D.: Effiecient processing of xml twig pattern: A novel one-phase holistic solution. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 87–97. Springer, Heidelberg (2007)
Choi, B., Mahoui, M., Wood, D.: On the optimal of holistic algorithms for twig queries. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 28–37. Springer, Heidelberg (2003)
Aghili, S.A., Li, H.-G., Agrawal, D., Abbadi, A.E.: Twix: Twig structure and content matching of selective queries using binary labeling. In: Proceedings of the First International Conference on Scalable Information Systems (INFORSCALE 2006), Hong Kong, ACM, New York (2006)
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 the 18th International Conference on Data Engineering (ICDE 2002) (2002)
Lu, J., Ling, T., Chen, T.: Tjfast: Effective processing of xml twig pattern matching. In: Proceedings of the 14th International Conference on World Wide Web (WWW), pp. 1118–1119 (2005)
Lu, J., Chen, T., Ling, T.W.: Efficient processing of xml twig patterns with parent child edges: A look-ahead approach. In: Grossman, D., Gravano, L., Zhai, C., Herzog, O., Evans, D.A. (eds.) Proceedings of the ACM Thirteenth Conference on Information and Knowledge Management (CIKM 2004), pp. 533–542. ACM, New York (2004)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: Proceedings of ACM SIGMOSD 2001, pp. 425–436. ACM, New York (2001)
Shanmugasundaram, J., Tufte, K., He, G., Zhang, C., DeWitt, D., Naughton, J.: Relational databases for query xml documents: Limitations and opportunities. In: Proceedings of the 25th VLDB Conference, pp. 302–314 (1999)
Wu, Y., Patel, J.M., Jagadish, H.V.: Structural join order selection for xml query optimization. In: Proceedings of the 19th International Conference on Data Engineering (ICDE 2003), pp. 443–454. IEEE, Los Alamitos (2003)
Chen, T., Lu, J., Ling, T.W.: On boosting holism in xml twig pattern matching using structural indexing techniques, Baltimore, Maryland, USA, pp. 455–466 (2005)
Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J.: Efficient structural joins on indexed xml documents. In: Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), pp. 263–274 (2002)
Jiang, H., Lu, H., Wang, W., Ooi, B.C.: Xr-tree: Indexing xml data for efficient structural joins. In: Proceedings of the 19th International Conference on Data Engineering (ICDE 2003), pp. 253–264. IEEE, Los Alamitos (2003)
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: Proceedings of the 31st VLDB Conference, Norway, pp. 193–204. VLDB (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dao, DB., Cao, J. (2008). A Glance on Current XML Twig Pattern Matching Algorithms. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)