Abstract
Since Chen’s Entity-Relationship (ER) model, conceptual modelling has been playing a fundamental role in relational data design. In this paper we consider an extended ER model enriched with cardinality constraints, disjunction assertions, and is-a relations among both entities and relationships; we present a framework in which the data underlying an ER schema can be directly queried through the schema by using suitable predicates. In this setting, we consider the case of incomplete data, which is likely to happen, for instance, when data from different sources are integrated. We address the problem of providing correct answers to conjunctive queries by reasoning on the schema. Based on previous results about decidability of the problem, we provide a query answering algorithm based on rewriting the initial query into a recursive Datalog query, in which the information about the schema is encoded. We finally give some complexity results, and we show extensions to more general settings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co, London, UK (1995)
Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. of PODS 1999, pp. 68–79 (1999)
Calì, A.: Query answering and optimisation in information integration. PhD thesis, Università di Roma “La Sapienza” (February 2003)
Calì, 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)
Calì, 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)
Calì, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: Data integration under integrity constraints. Information Systems 29, 147–163 (2004)
Calì, 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)
Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI 2003, pp. 16–21 (2003)
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)
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)
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS’98, pp. 149–158 (1998)
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)
Chen, P.: The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems 1(1), 9–36 (1976)
Codd, E.F.: A relational model of data for large shared data banks. Comm. of the ACM 13(6), 377–387 (1970)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33(3), 374–425 (2001)
Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: Oliver, M. (ed.) Proc. of PODS’97, pp. 109–116 (1997)
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)
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)
Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Phokion, G. (ed.) Proc. of PODS’98, pp. 205–213 (1998)
Lembo, D.: Dealing with Inconsistency and Incompleteness in Data Integration. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma “La Sapienza” (2004)
Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS 2002, pp. 233–246 (2002)
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. on Database Systems 4, 455–469 (1979)
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)
Markowitz, V.M., Makowsky, J.A.: Identifying extended entity-relationship object structures in relational schemas. IEEE Trans. Software Eng. 16(8), 777–790 (1990)
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)
Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 119–140. Plenum Publ.Co. (1978)
Vardi, M.: Inferring multivalued dependencies from functional and join dependencies. Acta Informatica 19, 305–324 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calì, A. (2007). Querying Incomplete Data with Logic Programs: ER Strikes Back. In: Parent, C., Schewe, KD., Storey, V.C., Thalheim, B. (eds) Conceptual Modeling - ER 2007. ER 2007. Lecture Notes in Computer Science, vol 4801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75563-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-75563-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75562-3
Online ISBN: 978-3-540-75563-0
eBook Packages: Computer ScienceComputer Science (R0)