Abstract
The evaluation of path queries forms the basis of complex XML query processing which has attracted a lot of research attention. However, none of these works have examined the processing of more complex queries that contain not-predicates. In this paper, we present the first study on evaluating path queries with not-predicates. We propose an efficient holistic path join algorithm, PathStack¬, which has the following advantages: (1) it requires only one scan of the relevant data to evaluate path queries with not-predicates; (2) it does not generate any intermediate results; and (3) its memory space requirement is bounded by the longest path in the input XML document. We also present an improved variant of PathStack¬ that further minimizes unnecessary computations.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML pattern matching. In: Proc. of the SIGMOD (2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. Technical Report. Columbia University (March 2002)
Florescu, D., Kossman, D.: Storing and querying XML data using an RDMBS. IEEE Data Engineering Bulletin 22(3), 27–34 (1999)
Jiang, H., Lu, H., Wang, W.: Efficient Processing of XML Twig Queries with OR-Predicates. In: Proc. of the SIGMOD 2004 (2004)
Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins on indexed XML documents. In: Proc. of the VLDB, pp. 273–284 (2003)
Jiao, E.: Efficient processing of XML path queries with not-predicates, M.Sc. Thesis, Na-tional University of Singapore (2004)
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proc. of the VLDB, pp. 361–370 (2001)
Riebig, R., Moerkotte, G.: Evaluating queries on structure with access support relations. In: Proc. of the WebDB 2000 (2000)
Shanmugasundaram, J., Tufte, K., Zhang, C., He, G., DeWitt, D.J., Naughton, J.F.: Relational databases for querying XML documents: Limitations and opportunities. In: Proc. of VLDB (1999)
Srivastava, D., Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Wu, Y.: Structural joins: A primitive for efficient XML query pattern matching. In: Proc. of the ICDE, pp. 141–152 (2002)
Wang, H., Park, S., Fan, W., Yu, P.S.: Vist: A dynamic index method for querying XML data by tree structures. In: Proc. of the SIGMOD, pp. 110–121 (2003)
Wu, Y., Patel, J.M., Jagadish, H.V.: Structural join order selection for XML query optimization. In: Proc. of the ICDE, pp. 443–454 (2003)
Zhang, C., Naughton, J., Dewitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: Proc. of the SIGMOD (2001)
Treebank.XML, http://www.cis.upenn.edu/~treebank/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiao, E., Ling, T.W., Chan, CY. (2005). PathStack¬: A Holistic Path Join Algorithm for Path Query with Not-Predicates on XML Data. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_12
Download citation
DOI: https://doi.org/10.1007/11408079_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)