Author:
CALÌ ANDREA,MARTINENGHI DAVIDE
Abstract
AbstractSince 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference40 articles.
1. Inferring multivalued dependencies from functional and join dependencies
2. 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.
3. On the Complexity of Testing Implications of Functional and Join Dependencies
4. Lenzerini M. 2002. Data integration: A theoretical perspective. In Proc. of PODS 2002, 233–246.
5. Lembo D. 2004. Dealing with inconsistency and incompleteness in data integration. PhD thesis, Dip. di Inf. e Sist., Univ. di Roma “La Sapienza.”
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献