Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-05T16:37:54.771Z Has data issue: false hasContentIssue false
  • English
  • Français

Querying incomplete data over extended ER schemata

Published online by Cambridge University Press:  12 May 2010

ANDREA CALÌ  and
DAVIDE MARTINENGHI
ANDREA CALÌ
Affiliation:
Computing Laboratory, University of Oxford, Eagle House, Walton Well Road, Oxford OX2 6ED, UK (e-mail: [email protected])
DAVIDE MARTINENGHI
Affiliation:
Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo 32, 20133 Milano, Italy (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Since Chen's Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and is a relations among both entities and relationships. In this setting, we consider the case of incomplete data, which is likely to occur, for instance, when data from different sources are integrated. In such a context, 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 that performs rewriting of the initial query into a recursive Datalog query encoding the information about the schema. We finally show extensions to more general settings.

Keywords

Extended ER modeldependencieschaseincomplete data
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 10 , Special Issue 3: Logic Programming in Databases: from Datalog to Semantic-Web Rules , May 2010 , pp. 291 - 329
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abiteboul, S., Hull, R. and Vianu, V. 1995. Foundations of Databases. Addison Wesley Publishing Co.Google Scholar
Arenas, M., Bertossi, L. E. and Chomicki, J. 1999. Consistent query answers in inconsistent databases. In Proc. of PODS'99, 68–79.Google Scholar
Bertossi, L. E. and Bravo, L. 2005. Consistent query answers in virtual data integration systems. In Inconsistency Tolerance, Bertossi, L. E., Hunter, A. and Schaub, T., Eds. Lecture Notes in Computer Science, vol. 3300. Springer, 42–83.CrossRefGoogle Scholar
Calì, A. 2003. Query answering and optimisation in information integration. PhD thesis, Universit di Roma “La Sapienza.”Google Scholar
Calì, A. 2006. Containment of conjunctive queries over conceptual schemata. In Proc. of DASFAA 2006, 270–284.Google Scholar
Calì, A. 2007. Querying incomplete data with logic programs: Er strikes back. In ER, Parent, C., Schewe, K.-D., Storey, V. C. and Thalheim, B., Eds. Lecture Notes in Computer Science, vol. 4801. Springer, 245–260.Google Scholar
Calì, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. 2001. Accessing data integration systems through conceptual schemas. In Proc. of ER 2001, 270–284.Google Scholar
Calì, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. 2004. Data integration under integrity constraints. Information Systems 29, 147–163.CrossRefGoogle Scholar
Calì, A., Gottlob, G. and Kifer, M. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2008), 70–80.Google Scholar
Calì, A., Lembo, D. and Rosati, R. 2003a. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS 2003, 260–271.Google Scholar
Calì, A., Lembo, D. and Rosati, R. 2003b. Query rewriting and answering under constraints in data integration systems. In Proc. of IJCAI 2003, 16–21.Google Scholar
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M. and Rosati, R. 2005. DL-Lite: Tractable description logics for ontologies. In Proc. of AAAI 2005, 602–607.Google Scholar
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M. and Rosati, R. 2006. Data complexity of query answering in description logics. In Proc. of the 10th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2006), 260–270.Google Scholar
Calvanese, D., De Giacomo, G. and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of PODS'98, 149–158.Google Scholar
Chan, E. P. F. 1992. Containment and minimization of positive conjunctive queries in OODB's. In Proc. of PODS'92, 202–211.Google Scholar
Chen, P. 1976. The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems 1, 1 (March), 9–36.Google Scholar
Chomicki, J. and Marcinkowski, J. 2005. Minimal-change integrity maintenance using tuple deletions. Information and Computation 197, 1–2, 90–121.CrossRefGoogle Scholar
Codd, E. F. 1970. A relational model of data for large shared data banks. Communications of the ACM 13, 6, 377–387.CrossRefGoogle Scholar
Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys 33, 3, 374–425.CrossRefGoogle Scholar
Deutsch, A., Nash, A. and Remmel, J. B. 2008. The chase revisited. In PODS, 149–158.Google Scholar
Duschka, O. M. and Genesereth, M. R. 1997. Answering recursive queries using views. In Proc. of PODS'97, 109–116.Google Scholar
Duschka, O. M. and Levy, A. Y. 1997. Recursive plans for information gathering. In Proc. of IJCAI'97, 778–784.Google Scholar
Fagin, R., Kolaitis, P. G., Miller, R. J. and Popa, L. 2005. Data exchange: semantics and query answering. Theoretical Computer Science 336, 1, 89–124.CrossRefGoogle Scholar
Gottlob, G. and Nash, A. 2008. Efficient core computation in data exchange. Journal of the ACM 55, 2.CrossRefGoogle Scholar
Grant, J., Ling, T. and Lee, M. 1993. ERL: Logic for entity-relationship databases. Journal of Intelligent Information Systems 2, 2, 115–147.CrossRefGoogle Scholar
Hernández, M. A. and Stolfo, S. J. 1998. Real-world data is dirty: Data cleansing and the merge/purge problem. J. of Data Mining and Knowledge Discovery 2, 1, 9–37.CrossRefGoogle Scholar
Hohenstein, U. and Engels, G. 1992. SQL/EER – syntax and semantics of an entity-relationship-based query language. Information Systems 17, 3, 209–242.CrossRefGoogle Scholar
Johnson, D. S. and Klug, A. C. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28, 1, 167–189.CrossRefGoogle Scholar
Kolaitis, P. G. and Vardi, M. Y. 1998. Conjunctive-query containment and constraint satisfaction. In Proc. of PODS'98, 205–213.Google Scholar
Lawley, M. and Topor, R. 1994. A query language for EER schemas. In Proceedings of ADC 1994, 292–304.Google Scholar
Lembo, D. 2004. Dealing with inconsistency and incompleteness in data integration. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma “La Sapienza.”Google Scholar
Lenzerini, M. 2002. Data integration: A theoretical perspective. In Proc. of PODS 2002, 233–246.Google Scholar
Lloyd, J. W. 1987. Foundations of Logic Programming (Second, Extended Edition). Springer, Berlin.CrossRefGoogle Scholar
Maier, D., Mendelzon, A. O. and Sagiv, Y. 1979. Testing implications of data dependencies. ACM Transactions on Database Systems 4, 455–469.CrossRefGoogle Scholar
Maier, D., Sagiv, Y. and Yannakakis, M. 1981. On the complexity of testing implications of functional and join dependencies. Journal of the ACM 28, 4, 680–695.CrossRefGoogle Scholar
Markowitz, V. M. and Makowsky, J. A. 1990. Identifying extended entity-relationship object structures in relational schemas. IEEE Transactions on Software Engineering 16, 8, 777–790.CrossRefGoogle Scholar
Ortiz, M., Calvanese, D. and Eiter, T. 2006. Characterizing data complexity for conjunctive query answering in expressive description logics. In Proc. of the 21st National Conference on Artificial Intelligence (AAAI 2006), 275–280.Google Scholar
Reiter, R. 1978. On closed world data bases. In Logic and Databases, Gallaire, H. and Minker, J., Eds. Plenum Publishing Co., 119–140.Google Scholar
Thalheim, B. 2000. Entity Relationship Modeling – Foundations of Database Technology. Springer.CrossRefGoogle Scholar
Vardi, M. 1983. Inferring multivalued dependencies from functional and join dependencies. Acta Informatica 19, 305–324.CrossRefGoogle Scholar