Abstract
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algorithms for finding minimal containing and maximal contained rewritings and for deciding whether an exact rewriting exists. We show that rewriting queries using views in this case reduces (a) to rewriting queries with access patterns and constraints without views and also (b) to rewriting queries using views under constraints without access patterns. We show how to solve (a) directly and how to reduce (b) to rewriting queries under constraints only (semantic optimization). These reductions provide two separate routes to a unified solution for all three problems, based on an extension of the relational chase theory to queries and constraints with disjunction and negation. We also handle equality and arithmetic comparisons.
Supported by NSF/CAREER 0347968, NSF/ITR 0225673 (GEON), NSF/ITR 0225674 (SEEK), DOE SciDAC DE-FC02-01ER25486 (SDM), NIH/NCRR 1R24 RR019701-01 Biomedical Informatics Research Network Coordinating Center (BIRN-CC).
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: ACM Symposium on Theory of Computing (STOC), pp. 77–90 (1977)
Deutsch, A., Ludäscher, B., Nash, A.: Rewriting queries using views with access patterns under integrity constraints. Technical report, Department of Computer Science and Engineering, UCSD (2004); Extended version of this paper, http://www.db.ucsd.edu:8080/root/index.jsp?pageStr=publications
Deutsch, A., Tannen, V.: Mars: A system for publishing xml from mixed and redundant storage. In: Intl. Conf. on Very Large Data Bases (VLDB) (2003)
Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)
Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: PODS (1997)
Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive query plans for data integration. Journal of Logic Programming 43(1), 49–73 (2000)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)
Florescu, D., Levy, A.Y., Manolescu, I., Suciu, D.: Query optimization in the presence of limited access patterns. In: SIGMOD, pp. 311–322 (1999)
Grant, J., Minker, J.: A logic-based approach to data integration. Theory and Practice of Logic Programming 2(3), 323–368 (2002)
Halevy, A.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)
Koch, C.: Query rewriting with symmetric constraints. AI Communications 17(2) (2004) (to appear)
Levy, A.Y.: Logic-based techniques in data integration. In: Minker, J. (ed.) Workshop on Logic-Based Artificial Intelligence, Washington, DC (1999)
Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying heterogeneous information sources using source descriptions. In: 22nd Intl. Conf. on Very Large Data Bases (VLDB), Bombay, India, pp. 251–262 (1996)
Li, C.: Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB 12, 211–227 (2003)
Li, C., Chang, E.: On answering queries in the presence of limited access patterns. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, p. 219. Springer, Heidelberg (2000)
Millstein, T.D., Levy, A.Y., Friedman, M.: Query containment for data integration systems. In: PODS, pp. 67–75 (2000)
Nash, A., Ludäscher, B.: Processing first-order queries under limited access patterns. In: PODS, Paris, France (2004)
Nash, A., Ludäscher, B.: Processing unions of conjunctive queries with negation under limited access patterns. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 422–440. Springer, Heidelberg (2004)
Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: PODS, pp. 105–112 (1995)
Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. Journal of the ACM 27(4), 633–655 (1980)
Ullman, J.: The complexity of ordering subgoals. In: PODS (1988)
Vassalos, V., Papakonstantinou, Y.: Expressive capabilities description languages and query rewriting algorithms. Journal of Logic Programming 43(1), 75–122 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deutsch, A., Ludäscher, B., Nash, A. (2004). Rewriting Queries Using Views with Access Patterns Under Integrity Constraints. In: Eiter, T., Libkin, L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30570-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30570-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24288-8
Online ISBN: 978-3-540-30570-5
eBook Packages: Computer ScienceComputer Science (R0)