Querying incomplete data with logic programs: ER strikes back

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

Volumn 4801 LNCS, Issue , 2007, Pages 245-260

  Calì, Andrea ^a,b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

CONCEPTUAL MODELING; DATA DESIGN; ENTITY-RELATIONSHIP (ER) MODEL;

QUERY PROCESSING;

EID: 38349047890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75563-0_18     Document Type: Conference Paper

References (27)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co, London, UK (1995)
2. Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. of PODS 1999, pp. 68-79 (1999)
3. Call, A.: Query answering and optimisation in information integration. PhD thesis, Universita di Roma "La Sapienza" (February 2003)
4. Call, A.: Containment of conjunctive queries over conceptual schemata. In: Lee, M.L., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 270-284. Springer, Heidelberg (2006)
5. Call, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: Accessing data integration systems through conceptual schemas. In: Kunii, H.S., Jajodia, S., Sølvberg, A. (eds.) ER 2001. LNCS, vol. 2224, Springer, Heidelberg (2001)
6. Calì, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: Data integration under integrity constraints. Information Systems 29, 147-163 (2004)
7. Call, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS 2003, pp. 260-271 (2003)
8. Call, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI 2003, pp. 16-21 (2003)
9. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of AAAI 2005, pp. 602-607 (2005)
10. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260-270 (2006)
11. Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS'98, pp. 149-158 (1998)
12. Edward, P.F.: Containment and minimization of positive conjunctive queries in OODB's. In: Edward, P.F. (ed.) Proc. of PODS'92, pp. 202-211 (1992)
13. Chen, P.: The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems 1(1), 9-36 (1976)
14. Codd, E.F.: A relational model of data for large shared data banks. Comm. of the ACM 13(6), 377-387 (1970)
15. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33(3), 374-425 (2001)
16. Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: Oliver, M. (ed.) Proc. of PODS'97, pp. 109-116 (1997)
17. Hernández, M.A., Stolfo, S.J.: Real-world data is dirty: Data cleansing and the merge/purge problem. J. of Data Mining and Knowledge Discovery 2(1), 9-37 (1998)
18. David, S., Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences 28(1), 167-189 (1984)
19. Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Phokion, G. (ed.) Proc. of PODS'98, pp. 205-213 (1998)
20. Lembo, D.: Dealing with Inconsistency and Incompleteness in Data Integration. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma "La Sapienza" (2004)
21. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS 2002, pp. 233-246 (2002)
22. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. on Database Systems 4, 455-469 (1979)
23. Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. J. of the ACM 28(4), 680-695 (1981)
24. Markowitz, V.M., Makowsky, J.A.: Identifying extended entity-relationship object structures in relational schemas. IEEE Trans. Software Eng. 16(8), 777-790 (1990)
25. Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI 2006) (2006)
26. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 119-140. Plenum Publ.Co. (1978)
27. Vardi, M.: Inferring multivalued dependencies from functional and join dependencies. Acta Informatica 19, 305-324 (1983)