Abstract
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 ¬.
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.
Similar content being viewed by others
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: Proceedings of ICDE, pp. 141–152 (2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of SIGMOD, pp. 310–321 (2002)
Chen, T., Lu, J., Ling, T.W.: On boosting holism in XML twig pattern matching using structural indexing techniques. In: Proceedings of SIGMOD (2005)
Jiang, H., Lu, H., Wang, W.: Efficient processing of twig queries with or-predicates. In: Proceeding of SIGMOD, pp. 59–70 (2004)
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)
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)
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)
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)
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)
Rao, P., Moon, B.: PRIX: Indexing adnd quering XML using prüfer sequences. In: Proceedings of ICDE (2004)
Treebank, http://www.cs.washington.edu/research/xmldatasets/www/repository.html
Wang, H., Meng, X.: On the sequencing of tree structures for XML indexing. In: Proceeding of ICDE, pp. 372–383 (2005)
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)
XMARK, http://monetdb.cwi.nl/xml
XPath, http://www.w3.org/TR/xpath
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)
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
Yu, T., Ling, T.W., Lu, J. (2006). TwigStackList ¬: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data. 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_19
Download citation
DOI: https://doi.org/10.1007/11733836_19
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)