Computing covers for embedded functional dependencies
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
Calculating constraints on relational expression
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Properties of functional-dependency families
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Constraint-generating dependencies
Journal of Computer and System Sciences
Principles of Database Systems
Principles of Database Systems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database System Concepts
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Conditional Dependencies for Horizontal Decompositions
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Extending and inferring functional dependencies in schema transformation
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Conditional functional dependencies for capturing data inconsistencies
ACM Transactions on Database Systems (TODS)
On keys and functional dependencies as first-class citizens in description logics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Estimating the confidence of conditional functional dependencies
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Conditional Dependencies: A Principled Approach to Improving Data Quality
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Differential dependencies: Reasoning and discovery
ACM Transactions on Database Systems (TODS)
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Editorial: Efficient discovery of similarity constraints for matching dependencies
Data & Knowledge Engineering
Hi-index | 0.00 |
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 for CFD 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 via SPC 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.