Containment of conjunctive queries over conceptual schemata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3882 LNCS, Issue , 2006, Pages 628-643

  Calì, Andrea ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATABASE SYSTEMS; PROBLEM SOLVING; SEMANTICS;

CONCEPTUAL MODELING; CONJUNCTIVE QUERIES; DATA INTEGRATION; ENTITY-RELATIONSHIP (ER);

QUERY LANGUAGES;

EID: 33745540052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11733836_44     Document Type: Conference Paper

References (16)

1. Serge Abiteboul and Oliver Duschka, Complexity of answering queries using materialized views. In Proc. of PODS'98, pages 254-265, 1998.
2. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison Wesley Publ. Co., 1995.
3. Andrea Calì, Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. Accessing data integration systems through conceptual schemas. In Proc. of ER 2001, pages 270-284, 2001.
4. Andrea Calì, Domenico Lembo, and Riccardo Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS 2003, pages 260-271, 2003.
5. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI 2005, pages 602-607, 2005.
6. Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS'98, pages 149-158, 1998.
7. Edward P. F. Chan. Containment and minimization of positive conjunctive queries in OODB's, In Proc. of PODS'92, pages 202-211, 1992.
8. Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOC'77, pages 77-90, 1977.
9. P. P. Chen. The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems, 1(1):9-36, March 1976.
10. E. F. Codd. A relational model of data for large shared data banks. Comm. of the ACM, 13(6):377-387, 1970.
11. David S. Johnson and Anthony C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences, 28(1):167-189, 1984.
12. Phokion G. Kolaitis and Moshe Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proc. of PODS'98, pages 205-213, 1998.
13. David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. Testing implications of data dependencies. ACM Trans. on Database Systems, 4:455-469, 1979.
14. David Maier, Yehoshua Sagiv, and M. Yannakakis. On the complexity of testing implications of functional and join dependencies. J. of the ACM, 28(4):680-695, 1981.
15. Maria Magdalena Ortiz de la Fuente, Diego Calvanese, Thomas Eiter, and Enrico Franconi. Data complexity of answering conjunctive queries over SHIQ knowledge bases. Technical report, Free University of Bozen-Bolzano, 2005. http:// arxiv.org/abs/cs.LO/0507059/.
16. Moshe Vardi. Inferring multivalued dependencies from functional and join dependencies. Acta Information, 19:305-324, 1983.