Querying incomplete data over extended er schemata

  • Authors:
  • Andrea CalÌ;Davide Martinenghi

  • Affiliations:
  • Computing laboratory, university of oxford, eagle house, walton well road, oxford ox2 6ed, uk (e-mail: andrea.cali@comlab.ox.ac.uk);Dipartimento di elettronica e informazione, politecnico di milano, piazza leonardo 32, 20133 milano, italy (e-mail: davide.martinenghi@polimi.it)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.