Data Integration under Integrity Constraints

By Andrea Calì, Diego Calvanese, Maurizio Lenzerini. International Conference on Advanced Information Systems Engineering, 2004

328 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the decidability and complexity of query answering over inconsistent and incomplete databases (2003, background): ““⇐” Analogously to [7], it can be proved by induction on the structure of chase(DB,D) that, for any database instance B ∈ sems(DB,D), there exists a homomorphism μ that sends the tuples of chase(DB,D) to the tuples of B.”
The chase revisited (2008, background): “Notable exceptions are [5, 6], which present rewriting algorithms based on the properties of the chase (in general inﬁnite).”
Data integration: a theoretical perspective (2002, methodology): “Notable examples are TSIMMIS [51], Garlic [30], COIN [52], MOMIS [10], Squirrel [92], and IBIS [17].”
Methodologies for data quality assessment and improvement (2009, background): “Integrity constraints have also been studied as enablers of data integration [Cal` i et al. 2004].”
Data exchange: semantics and query answering (2003, background): “[6] studied GAV systems with key and foreign key constraints at the target.”