Bravo, Loreto

Fan, Wenfei

Ma, Shuai

English

This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related data values. We show that CINDs are useful not only in data cleaning, but are also in contextual schema matching [7]. To make effective use of CINDs in practice, it is often necessary to reason about them. The most important static analysis issue concerns consistency, to determinewhether or not a given set of CINDs has conflicts. Another issue concerns implication, i.e., deciding whether a set of CINDs entails another CIND. We give a full treatment of the static analyses of CINDs, and show that CINDs retain most nice properties of traditional INDs: (a) CINDs are always consistent; (b) CINDs are finitely axiomatizable, i.e., there exists a sound and complete inference system for implication of CINDs; and (c) the implication problem for CINDs has the same complexity as its traditional counterpart, namely, PSPACE-complete, in the absence of attributes with a finite domain; but it is EXPTIME-complete in the general setting. In addition, we investigate the interaction between CINDs and conditional functional dependencies (CFDs), an extension of functional dependencies proposed in [9]. We show that the consistency problem for the combination of CINDs and CFDs becomes undecidable. In lightof the undecidability, we provide heuristic algorithms for the consistencyanalysis of CFDs and CINDs, and experimentally verify the effectiveness and efficiency of our algorithms

Edinburgh Research Explorer

A costbased model and effective heuristic for repairing constraints by value modiﬁcation.

A proof procedure for data dependencies.

Bertossi.Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics.

Census data repair: a challenging application of disjunctive logic programming.

Chasing Constrained TupleGenerating Dependencies.

Clio grows up: from research prototype to industrial tool.

Conditional functional dependencies for data cleaning.

Consistent query answering in databases.

Consistent query answers in inconsistent databases.

Constrained dependencies.

ConstraintGenerating Dependencies.

Data cleaning: Problems and current approaches.

Database repairing using updates.

Domino-tiling games.

Foundations of Databases.

Inclusion dependencies and their interaction with functional dependencies.

Minimal-change integrity maintenance using tuple deletions.

Putting context into schema matching.

Query reformulation with constraints.

Satisﬁability of integrity constraints: Reﬂections on a neglected problem.

Schema mappings, data exchange, and metadata management.

SIC: Satisﬁability checking for integrity constraints. In

Testing containment of conjunctive queries under functional and inclusion dependencies.

Extending Dependencies with Conditions

Extending Dependencies with Conditions

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer