Taming the infinite chase: Query answering under expressive relational constraints

CEUR Workshop Proceedings

Volumn 353, Issue , 2008, Pages

  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

ANSWER SET; ANSWERING QUERIES; CENTRAL PROBLEMS; COMPLEX CONSTRAINTS; CONCEPTUAL DATA MODELING; DATA BASE THEORY; DESCRIPTION LOGIC; ENTITY-RELATIONSHIP; KNOWLEDGE BASIS; LOGIC CONSTRAINTS; OBJECT CLASSIFICATION; OBJECT ORIENTED; QUERY ANSWERING; QUERY CONTAINMENT; QUERY OPTIMIZATION; REASONING TASKS; RELATIONAL CONSTRAINT; SCHEMA INTEGRATION; SERVICE DISCOVERY;

DATA DESCRIPTION; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION;

QUERY PROCESSING;

EID: 84865085989     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Aho, Y. Sagiv, and J. D. Ullman. Equivalence of relational expressions. SIAM J. of Computing, 8(2):218-246, 1979.
2. Andrea Calì. Querying incomplete data with logic programs: ER strikes back. In ER 2007, pages 245-260, 2007.
3. Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: reasoning under expressive relational constraints. Unpublished technical report, http://www.andreacali.com/CGK.pdf, 2008.
4. Andrea Calì and Michael Kifer. Containment of conjunctive object meta-queries. In VLDB 2006, pages 942-952. VLDB Endowment, 2006.
5. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In PODS 1998, pages 149-158, 1998.
6. D. Calvanese, G. De Giacomo, and M Lenzerini. Description logics for information integration. In A. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, volume 2408 of Lecture Notes in Computer Science, pages 41-60. Springer, 2002.
7. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning, 39(3):385-429, 2007.
8. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC 1977, pages 77-90, 1977.
9. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
10. M. Elisabeth Goncalves and Erich Grädel. Decidability issues for action guarded logics. In Description Logics, pages 123-132, 2000.
11. Georg Gottlob and Alan Nash. Data exchange: computing cores in polynomial time. In PODS, pages 40-49, 2006.
12. D.S. Johnson and A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences, 28:167-189, 1984.
13. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and framebased languages. Journal of ACM, 42:741-843, July 1995.
14. L. Li and I. Horrocks. A software framework for matchmaking based on semantic web technology. In WWW 2003, 2003.
15. David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. Testing implications of data dependencies. TODS, 4(4):455-469, 1979.
16. T. Millstein, A. Levy, and M. Friedman. Query containment for data integration systems. In PODS 2000, pages 67-75, 2000.
17. Alan Nash, Alin Deutsch, and Jeff Remmel. Data exchange, data integration, and chase. Technical Report CS2006-0859, UCSD, April 2006.
18. Riccardo Rosati. On conjunctive query answering in EL. In 20th International Workshop on Description Logics (DL-2007). CEUR Electronic Workshop Proceedings, 2007.
19. Mantas Simkus and Thomas Eiter. DNC: Decidable non-monotonic disjunctive logic programs with function symbols. In LPAR 2007, pages 514-530, 2007.