Daniel Pasailă
ABSTRACT
The problem of whether a query Q can be answered using a set of views V studies the possibility of computing Q when only the answers to the given set of views are available. In information-theoretic terms, we say that V determines Q iff for any two databases D1, D2, V(D1) = V(D2) implies Q(D1) = Q(D2). In the case that V determines Q, we also study the existence of equivalent rewritings of Q in terms of V in a specific rewriting language. Having a view language ν and a query language Q we say that ν-to-Q determinacy is decidable if there is an algorithm which, given a view V ε ν and a query Q ε Q, outputs whether V determines Q.
We focus on the case where the views and the query are defined by subclasses of conjunctive queries and investigate in which cases V determines Q and the existence of equivalent rewritings of Q in terms of V. We define the class of CQcgraph queries as binary CQ queries whose body, if viewed as an undirected graph, is connected. Next, we establish necessary conditions for determinacy in the CQcgraph-to-CQcgraph case. We also show that CQchain-to-CQcgraph determinacy is decidable, extending the previous decidability result for CQchain-to-CQchain, where CQchain denotes the class of binary CQ queries whose body is a simple path between the two free variables. Finally, we provide an algorithm which, starting with a set of CQcgraph views V and an integer κ, generates a set of CQcgraph queries that are determined by V and have their size bounded by κ.
- S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In PODS, pages 254--263. ACM Press, 1998. Google Scholar
Digital Library
- F. N. Afrati. Rewriting conjunctive queries determined by views. In L. Kucera and A. Kucera, editors, MFCS, volume 4708 of Lecture Notes in Computer Science, pages 78--89. Springer, 2007. Google ScholarDigital Library
- F. N. Afrati, C. Li, and V. Pavlaki. Data exchange in the presence of arithmetic comparisons. In A. Kemper, P. Valduriez, N. Mouaddib, J. Teubner, M. Bouzeghoub, V. Markl, L. Amsaleg, and I. Manolescu, editors, EDBT, volume 261 of ACM International Conference Proceeding Series, pages 487--498. ACM, 2008. Google ScholarDigital Library
- F. N. Afrati, C. Li, and J. D. Ullman. Generating efficient plans for queries using views. In SIGMOD Conference, pages 319--330, 2001. Google ScholarDigital Library
- R. Bayardo, W. Bohrer, R. S. Brice, A. Cichocki, J. Fowler, A. Helal, V. Kashyap, T. Ksiezyk, G. MMartin, M. H. Nodine, M. Rashid, M. Rusinkiewicz, R. Shea, C. Unnikrishnan, A. Unruh, and D. Woelk. Infosleuth: Semantic integration of information in open and dynamic environments (experience paper). In J. Peckham, editor, SIGMOD Conference, pages 195--206. ACM Press, 1997. Google ScholarDigital Library
- C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1977.Google Scholar
- C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. Theor. Comput. Sci., 239(2):211--229, 2000. Google ScholarDigital Library
- S. Dar, M. J. Franklin, B. T. Jónsson, D. Srivastava, and M. Tan. Semantic data caching and replacement. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, VLDB, pages 330--341. Morgan Kaufmann, 1996. Google ScholarDigital Library
- O. M. Duschka and M. R. Genesereth. Answering recursive queries using views. In PODS, pages 109--116. ACM Press, 1997. Google ScholarDigital Library
- D. Florescu, A. Y. Levy, I. Manolescu, and D. Suciu. Query optimization in the presence of limited access patterns. In A. Delis, C. Faloutsos, and S. Ghandeharizadeh, editors, SIGMOD Conference, pages 311--322. ACM Press, 1999. Google ScholarDigital Library
- L. M. Haas, D. Kossmann, E. L. Wimmers, and J. Yang. Optimizing queries across diverse data sources. In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, VLDB, pages 276--285. Morgan Kaufmann, 1997. Google ScholarDigital Library
- A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22--25, 1995, San Jose, California, pages 95--104. ACM Press, 1995. Google ScholarDigital Library
- M. Marx. Queries determined by views: pack your views. In L. Libkin, editor, PODS, pages 23--30. ACM, 2007. Google ScholarDigital Library
- A. Nash, L. Segoufin, and V. Vianu. Determinacy and rewriting of conjunctive queries using views: A progress report. In ICDT, pages 59--73, 2007. Google ScholarDigital Library
- A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, pages 105--112, 1995. Google ScholarDigital Library
- K. Stoffel and T. Studer. Provable data privacy. In K. V. Andersen, J. K. Debenham, and R. Wagner, editors, DEXA, volume 3588 of Lecture Notes in Computer Science, pages 324--332. Springer, 2005. Google ScholarDigital Library
- J. D. Ullman. Information integration using logical views. Theor. Comput. Sci., 239(2):189--210, 2000. Google ScholarDigital Library
Index Terms
- Conjunctive queries determinacy and rewriting
Recommendations
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Determinacy and rewriting of conjunctive queries over unary database schemas
SAC '11: Proceedings of the 2011 ACM Symposium on Applied ComputingThe problem of answering queries using views arises in a wide variety of data management applications. From the information-theoretic perspective, a notion of determinacy has been recently introduced to formalize the intuitive notion that whether a set ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments