{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T07:18:42Z","timestamp":1672643922779},"reference-count":40,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T00:00:00Z","timestamp":1273622400000},"content-version":"unspecified","delay-in-days":11,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2010,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1017\/s1471068410000104","type":"journal-article","created":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T06:11:31Z","timestamp":1273644691000},"page":"291-329","source":"Crossref","is-referenced-by-count":3,"title":["Querying incomplete data over extended ER schemata"],"prefix":"10.1017","volume":"10","author":[{"given":"ANDREA","family":"CAL\u00cc","sequence":"first","affiliation":[]},{"given":"DAVIDE","family":"MARTINENGHI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2010,5,12]]},"reference":[{"key":"S1471068410000104_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290729"},{"key":"S1471068410000104_ref37","unstructured":"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\u2013280."},{"key":"S1471068410000104_ref35","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322280"},{"key":"S1471068410000104_ref32","unstructured":"Lenzerini M. 2002. Data integration: A theoretical perspective. In Proc. of PODS 2002, 233\u2013246."},{"key":"S1471068410000104_ref31","unstructured":"Lembo D. 2004. Dealing with inconsistency and incompleteness in data integration. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma \u201cLa Sapienza.\u201d"},{"key":"S1471068410000104_ref30","unstructured":"Lawley M. and Topor R. 1994. A query language for EER schemas. In Proceedings of ADC 1994, 292\u2013304."},{"key":"S1471068410000104_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(92)90014-E"},{"key":"S1471068410000104_ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"S1471068410000104_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF00965874"},{"key":"S1471068410000104_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346334"},{"key":"S1471068410000104_ref4","unstructured":"Cal\u00ec A. 2003. Query answering and optimisation in information integration. PhD thesis, Universit di Roma \u201cLa Sapienza.\u201d"},{"key":"S1471068410000104_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/32.57618"},{"key":"S1471068410000104_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"S1471068410000104_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"S1471068410000104_ref22","unstructured":"Duschka O. M. and Levy A. Y. 1997. Recursive plans for information gathering. In Proc. of IJCAI'97, 778\u2013784."},{"key":"S1471068410000104_ref16","unstructured":"Chen P. 1976. The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems 1, 1 (March), 9\u201336."},{"key":"S1471068410000104_ref38","first-page":"119","volume-title":"Logic and Databases","author":"Reiter","year":"1978"},{"key":"S1471068410000104_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"S1471068410000104_ref2","unstructured":"Arenas M. , Bertossi L. E. and Chomicki J. 1999. Consistent query answers in inconsistent databases. In Proc. of PODS'99, 68\u201379."},{"key":"S1471068410000104_ref1","volume-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"S1471068410000104_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04058-4"},{"key":"S1471068410000104_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S1471068410000104_ref15","unstructured":"Chan E. P. F. 1992. Containment and minimization of positive conjunctive queries in OODB's. In Proc. of PODS'92, 202\u2013211."},{"key":"S1471068410000104_ref5","unstructured":"Cal\u00ec A. 2006. Containment of conjunctive queries over conceptual schemata. In Proc. of DASFAA 2006, 270\u2013284."},{"key":"S1471068410000104_ref14","unstructured":"Calvanese D. , De Giacomo G. and Lenzerini M. 1998. On the decidability of query containment under constraints. In Proc. of PODS'98, 149\u2013158."},{"key":"S1471068410000104_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30597-2_3"},{"key":"S1471068410000104_ref6","first-page":"245","volume-title":"ER","author":"Cal\u00ec","year":"2007"},{"key":"S1471068410000104_ref7","unstructured":"Cal\u00ec A. , Calvanese D. , De Giacomo G. and Lenzerini M. 2001. Accessing data integration systems through conceptual schemas. In Proc. of ER 2001, 270\u2013284."},{"key":"S1471068410000104_ref29","unstructured":"Kolaitis P. G. and Vardi M. Y. 1998. Conjunctive-query containment and constraint satisfaction. In Proc. of PODS'98, 205\u2013213."},{"key":"S1471068410000104_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(03)00050-4"},{"key":"S1471068410000104_ref11","unstructured":"Cal\u00ec A. , Lembo D. and Rosati R. 2003b. Query rewriting and answering under constraints in data integration systems. In Proc. of IJCAI 2003, 16\u201321."},{"key":"S1471068410000104_ref9","unstructured":"Cal\u00ec 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\u201380."},{"key":"S1471068410000104_ref10","unstructured":"Cal\u00ec 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\u2013271."},{"key":"S1471068410000104_ref12","unstructured":"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\u2013607."},{"key":"S1471068410000104_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"S1471068410000104_ref20","unstructured":"Deutsch A. , Nash A. and Remmel J. B. 2008. The chase revisited. In PODS, 149\u2013158."},{"key":"S1471068410000104_ref13","unstructured":"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\u2013270."},{"key":"S1471068410000104_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068410000104_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"S1471068410000104_ref21","unstructured":"Duschka O. M. and Genesereth M. R. 1997. Answering recursive queries using views. In Proc. of PODS'97, 109\u2013116."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:58:56Z","timestamp":1556467136000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000104\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["S1471068410000104"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000104","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}