Generating low-cost plans from proofs

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2014, Pages 200-211

  Benedikt, Michael ^a   Ten Cate, Balder ^b   Tsamoura, Efthymia ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INTERPOLATION; QUERY PROCESSING;

ACCESS COST; ACCESS RESTRICTION; FIRST-ORDER; INTEGRITY CONSTRAINTS; LOW-COST ACCESS; PREDICATE LOGIC; TUPLE-GENERATING DEPENDENCIES;

COSTS;

EID: 84904349740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2594538.2594550     Document Type: Conference Paper

References (22)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. C. Areces, P. Blackburn, and M. Marx. Hybrid logic: Characterization, interpolation and complexity. J.Symb. Log., 66(3):977-1010, 2001.
3. V. Bárány, M. Benedikt, and P. Bourhis. Access restrictions and integrity constraints revisited. In ICDT, 2013.
4. P. Blackburn and M. Marx. Constructive interpolation in hybrid logic. J. Symb. Log., 68(2):463-480, 2003.
5. A. Borgida, J. de Bruijn, E.Franconi, I. Seylan, U. Straccia, D. Toman, and G. E. Weddell. On finding query rewritings under expressive constraints. In SEBD, 2010.
6. A. Calì, T. Lukasiewicz, and G. Gottlob. A general datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14(0), 2012.
7. W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symb. Log., 22(3):269-285, 1957.
8. A. Deutsch, B. Ludäscher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. TCS, 371(3):200-226, 2007.
9. A. Deutsch, L. Popa, and V. Tannen. Physical data independence, constraints, and optimization with universal plans. In VLDB, 1999.
10. A. Deutsch, L. Popa, and V. Tannen. Query reformulation with constraints. SIGMOD Record, 35(1):65-73, 2006.
11. O. Duschka, M. Genesereth, and A. Levy. Recursive query plans for data integration. JLP, 43(1):49-73, 2000.
12. D. Florescu, A. Y. Levy, I. Manolescu, and D. Suciu. Query optimization in the presence of limited access patterns. In SIGMOD, 1999.
13. C. Hirsch and S. Tobies. A tableau algorithm for the clique guarded fragment. In Adv. Modal Logic, 2000.
14. A. Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, 1995.
15. C. Li. Computing complete answers to queries in the presence of limited access patterns. VLDB Journal, 12(3):211-227, 2003.
16. C. Li and E. Chang. Answering queries with useful bindings. TODS, 26(3):313-343, 2001.
17. Roger C. Lyndon. An interpolation theorem in the predicate calculus. Pacific J. Math., 9:129-142, 1959.
18. A. Nash, L. Segoufin, and V. Vianu. Views and queries: Determinacy and rewriting. TODS, 35(3), 2010.
19. A. Onet. The chase procedure and its applications in data exchange. In DEIS, 2013.
20. M. Otto. An interpolation theorem. B. Symb. Log., 6(4):447-462, 2000.
21. L. Popa. Object/Relational Query Optimization with Chase and Backchase. PhD thesis, U. Penn., 2000.
22. D. Toman and G. Weddell. Fundamentals of Physical Design and Query Compilation. Morgan Claypool, 2011.