Abstract
Efficient twig pattern matching is essential to XML queries and other tree-based queries. Numerous so-called holistic algorithms have been proposed to process the twig patterns in XML queries. However, a more general form of twig patterns, called B-twig (or Boolean-twig), which allow arbitrary combination of all the three logical connectives, AND, OR, and NOT in the twig patterns, has not yet been adequately addressed. In this paper, a new approach accompanied with an optimal implementation algorithm is presented for efficiently processing B-twig XML queries. Experimental study confirms the viability and performance superiority of our new approach.
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
NASA Goddard Astronomical Data Center (ADC) Scientific Dataset in XML, http://xml.coverpages.org/nasa-adc.html
XML Data Repository, http://www.cs.washington.edu/research/xmldatasets/
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal XML pattern matching. In: Proc. of SIGMOD, pp. 310–321 (2002)
Che, D.: Holistically processing XML twig queries with AND, OR, and NOT predicates. In: Proc. of Infoscale, p. 53 (2007)
Che, D., Ling, T.W., Hou, W.-C.: Holistic Boolean twig pattern matching for efficient XML query processing. In: IEEE TKDE, vol. 24, pp. 2008–2024 (November 2012)
Chen, T., Lu, J., Ling, T.W.: On boosting holism in XML twig pattern matching using structural indexing techniques. In: Proc. of SIGMOD, pp. 455–466 (2005)
Ding, D., Che, D., Hou, W.-C.: A direct approach to holistic boolean-twig pattern evaluation. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part I. LNCS, vol. 7446, pp. 342–356. Springer, Heidelberg (2012)
Grimsmo, N., Bjørklund, T.A., Hetland, M.L.: Fast optimal twig joins, vol. 3, pp. 894–905. VLDB Endowment (September 2010)
Izadi, S.K., Härder, T., Haghjoo, M.S.: S3: Evaluation of tree-pattern XML queries supported by structural summaries. Data Knowl. Eng. 68, 126–145 (2009)
Jiang, H., Lu, H., Wang, W.: XML query efficiency: Efficient processing of twig queries with OR-predicates. In: Proc. of SIGMOD, pp. 59–70 (2004)
Lu, J., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: A look-ahead approach. In: Proc. of CIKM, pp. 533–542 (November 2004)
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: Proc. of VLDB, pp. 193–204 (August 2005)
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, pp. 300–309. Springer, Heidelberg (2005)
Soh, K.H., Bhowmick, S.S.: Efficient evaluation of NOT-twig queries in tree-unaware relational databases. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 511–527. Springer, Heidelberg (2011)
Yu, T., Ling, T.-W., Lu, J.: Twigstacklist-: A holistic twig join algorithm for twig query with not-predicates on XML data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 249–263. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, D., Che, D., Cao, F., Hou, WC. (2013). A Practical Approach to Holistic B-Twig Pattern Matching for Efficient XML Query Processing. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds) Big Data. BNCOD 2013. Lecture Notes in Computer Science, vol 7968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39467-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-39467-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39466-9
Online ISBN: 978-3-642-39467-6
eBook Packages: Computer ScienceComputer Science (R0)