Fan, Wenfei

Hu, Yanli

Liu, Jie

Ma, Shuai

Wu, Yinghui

English

The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold on the view. This paper investigates dependency propagation for recently proposed conditional functional dependencies (CFDs). The need for this study is evident in data integration, exchange and cleaning since dependencies on data sources often only hold conditionally on the view. We investigate dependency propagation for views defined in various fragments of relational algebra, CFDs as view dependencies, and for source dependencies given as either CFDs or traditional functional dependencies (FDs). (a) We establish lower and upper bounds, all matching, ranging from ptime to undecidable. These not only provide the first results forCFD propagation, but also extend the classical work of FD propagation by giving new complexity bounds in the presence of finite domains. (b) We provide the first algorithm for computing a minimal cover of all CFDs propagated viaSPC views; the algorithm has the same complexity as one of the most efficient algorithms for computing a cover of FDs propagated via a projection view, despite the increased expressive power of CFDs and SPC views. (c) We experimentally verify that the algorithm is efficient

Edinburgh Research Explorer

An equational chase for pathconjunctive queries, constraints, and views.

Calculating constraints on relational expressions.

Chasing Constrained Tuple-Generating Dependencies.

Computers and Intractability: A Guide to the Theory of NP-Completeness.

Computing covers for embedded functional dependencies.

Conditional dependencies for horizontal decompositions.

Conditional functional dependencies for capturing data inconsistencies. TODS,

Constrained dependencies.

ConstraintGenerating Dependencies.

Data integration: A theoretical perspective.

Database System Concepts.

Determining view dependencies using tableaux.

Equivalences among relational expressions with the union and di®erence operators.

Equivalences among relational expressions.

Extending and inferring functional dependencies in schema transformation.

Extending dependencies with conditions.

Foundations of Databases.

Horn clauses and database dependencies.

Non-¯nite speci¯ability of projections of functional dependency families.

On keys and functional dependencies as ¯rst-class citizens in description logics.

Propagating functional dependencies with conditions

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer