Abstract
We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment both in the absence and presence of constraints. Containment without constraints for CRPQs is EXPSPACE-complete, as opposed to only NP-complete for relational conjunctive queries. Our past experience with implementing similar algorithms suggests that staying in PSPACE might still be useful. Therefore we investigate the complexity of containment for a hierarchy of fragments of the CRPQ language. The classifying principle of the fragments is the expressivity of the regular path expressions allowed in the query atoms. For most of these fragments, we give matching lower and upper bounds for containment in the absence of constraints. We also introduce for every fragment a naturally corresponding class of constraints in whose presence we show both decidability and undecidability results for containment in various fragments. Finally, we apply our results to give a complete algorithm for rewriting with views in the presence of constraints for a fragment that contains Kleene-star and disjunction.
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
S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufman, 1999.
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
C. Beeri and M. Vardi. A proof procedure for data dependencies. JACM, 31(4), 1984.
D. Calvanese, G. De Giacomo, and M. Lenzerini. On the Decidability of Query Containment under Constraints In PODS, 1998.
D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Vardi. Rewriting of Regular Expressions and Regular Path Queries. In PODS, 1999.
D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Vardi. Containment of conjunctive regular path queries with inverse. In KR, 2000.
Ashok Chandra and Philip Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, 1977.
A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. A Query Language for XML. In WWW8, 1999.
Alin Deutsch, Lucian Popa, and Val Tannen. Physical Data Independence, Constraints and Optimization with Universal Plans. In VLDB, 1999.
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB 2001.
A. Deutsch and V. Tannen. Optimization Properties for Classes of Conjunctive Regular Path Queries. Technical Report MS-CIS-01-20, University of Pennsylvania, 2001. Available from http://db.cis.upenn.edu/cgi-bin/Person.perl?adeutsch
M. Fernandez, D. Florescu, J. Kang, A. Levy, and D. Suciu. Strudel: A web-site management system. In SIGMOD, 1997.
Daniela Florescu, Alon Y. Levy, and Dan Suciu. Query containment for conjunctive queries with regular expressions. In PODS, 1998.
E. Grädel. On the restraining power of guards. J. of Symbolic Logic, 64, 1999.
Gösta Grahne and Alberto O. Mendelzon. Tableau techniques for querying information sources through global schemas. In ICDT, 1999.
G. Grahne and A. Thomo. An optimization technique for answering regular path queries. In WebDB, 2000.
G. Grahne and A. Thomo. Algebraic rewritings for regular path queries. ICDT’01.
J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.
Frank Neven and Thomas Schwentick. Query automata. In PODS, 1999.
Frank Neven and Thomas Schwentick. Expressive and efficient pattern languages for tree-structured data. In PODS, 2000.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
L. Popa, A. Deutsch, A. Sahuguet, and V. Tannen. A Chase Too Far? SIGMOD 2000.
Lucian Popa and Val Tannen. An equational chase for path-conjunctive queries, constraints, and views. In ICDT, 1999.
Yehoushua Sagiv and Mihalis Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27, 1980.
P. van Emde Boas. The convenience of tilings. In A. Sorbi(Ed.) Complexity, Logic, and Recursion Theory, pp. 331–363, 2000.
W3C. Extensible Markup Language (XML) 1.0. W3C Recommendation 10-February-1998. Available from http://www.w3.org/TR/1998/REC-xml-19980210.
W3C. XML Path Language (XPath) 1.0. W3C Recommendation 16 November 1999. Available from http://www.w3.org/TR/xpath.
M. Yannakakis and C. Papadimitriou. Algebraic dependencies. JCSS, 25, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deutsch, A., Tannen, V. (2002). Optimization Properties for Classes of Conjunctive Regular Path Queries. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-46093-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44080-2
Online ISBN: 978-3-540-46093-0
eBook Packages: Springer Book Archive