Taming the infinite chase: Query answering under expressive relational constraints

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 70-80

  Calì, Andrea ^a,b   Gottlob, Georg ^a,b   Kifer, Michael ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES; QUERY PROCESSING;

ANSWERING QUERIES; COMPLEXITY BOUNDS; CONJUNCTIVE QUERIES; DESCRIPTION LOGIC; ONTOLOGICAL REASONING; QUERY CONTAINMENT; RELATIONAL CONSTRAINT; TUPLE-GENERATING DEPENDENCIES;

KNOWLEDGE REPRESENTATION;

EID: 84860514494     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Aho, A.; Sagiv, Y.; and Ullman, J. D. 1979. Equivalence of relational expressions. SIAM J. of Computing 8(2):218- 246.
2. Beeri, C.; Fagin, R.; Maier, D.; Mendelzon, A. O.; Ullman, J. D.; and Yannakakis, M. 1981. Properties of acyclic database schemes. In STOC, 355-362.
3. Cal̀i, A., and Kifer, M. 2006. Containment of conjunctive object meta-queries. In VLDB 2006, 942-952.
4. Cal̀i, A.; Gottlob, G.; and Kifer, M. 2008. Extending datalog for terminological reasoning. Unpublished technical report, available from http://www.andreacali.com.
5. Cal̀i, A.; Lembo, D.; and Rosati, R. 2003. On the decidability and complexity of query answering over inconsistent and incomplete databases. In PODS 2003, 260-271.
6. Cal̀i, A. 2007. Querying incomplete data with logic programs: ER strikes back. In ER 2007, 245-260.
7. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3):385-429.
8. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In PODS 1998, 149-158.
9. Calvanese, D.; De Giacomo, G.; and Lenzerini., M. 2002. Description logics for information integration. In Computational Logic: Logic Programming and Beyond, volume 2408 of LNCS. Springer. 41-60.
10. Chandra, A., and Merlin, P. 1977. Optimal implementation of conjunctive queries in relational data bases. In STOC 1977, 77-90.
11. Courcelle, B. 1990. The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and Computation 85(1):12-75.
12. Deutsch, A., and Tannen, V. 2003. Reformulation of xml queries and constraints. In ICDT, 225-241.
13. Fagin, R.; Kolaitis, P. G.; Miller, R. J.; and Popa, L. 2005. Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1):89-124.
14. Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2008. Conjunctive query answering for the description logic SHIQ. J. of Artificial Intelligence Research 31:151-198.
15. Goncalves, M. E., and Grädel, E. 2000. Decidability issues for action guarded logics. In Description Logics, 123-132.
16. Gottlob, G., and Nash, A. 2006. Data exchange: computing cores in polynomial time. In PODS, 40-49.
17. Gottlob, G.; Leone, N.; and Scarcello, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3):579-627.
18. Heymans, S.; Nieuwenborgh, D. V.; and Vermeir, D. 2005. Guarded open answer set programming. In LPNMR 2005, 92-104.
19. Johnson, D., and Klug, A. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. JCSS 28:167-189.
20. Kifer, M.; Lausen, G.; and Wu, J. 1995. Logical foundations of object-oriented and frame-based languages. Journal of ACM 42:741-843.
21. Maier, D.; Mendelzon, A. O.; and Sagiv, Y. 1979. Testing implications of data dependencies. TODS 4(4):455-469.
22. Millstein, T.; Levy, A.; and Friedman, M. 2000. Query containment for data integration systems. In PODS 2000, 67-75.
23. Nash, A.; Deutsch, A.; and Remmel, J. 2006. Data exchange, data integration, and chase. Technical Report CS2006-0859, UCSD.
24. Qian, X. 1996. Query folding. In ICDE, 48-55.
25. Rabin, M. 1969. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society 141(1-35):4.
26. Rosati, R. 2006. On the decidability and finite controllability of query processing in databases with incomplete information. In PODS 2006, 356-365.
27. Rosati, R. 2007. On conjunctive query answering in EL. In 20th International Workshop on Description Logics (DL- 2007). CEUR Electronic Workshop Proceedings.
28. Simkus, M., and Eiter, T. 2007. DNC: Decidable nonmonotonic disjunctive logic programs with function symbols. In LPAR 2007, 514-530.