Conditional functional dependencies for capturing data inconsistencies
ACM Transactions on Database Systems (TODS)
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A revival of integrity constraints for data cleaning
Proceedings of the VLDB Endowment
Incorporating cardinality constraints and synonym rules into conditional functional dependencies
Information Processing Letters
Estimating the confidence of conditional functional dependencies
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Conditional Dependencies: A Principled Approach to Improving Data Quality
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Analyses and Validation of Conditional Dependencies with Built-in Predicates
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Integrity constraints in (conceptual) database models
The evolution of conceptual modeling
Differential dependencies: Reasoning and discovery
ACM Transactions on Database Systems (TODS)
Formalization and reasoning about spatial semantic integrity constraints
Data & Knowledge Engineering
Towards certain fixes with editing rules and master data
The VLDB Journal — The International Journal on Very Large Data Bases
Improving the Data Quality of Drug Databases using Conditional Dependencies and Ontologies
Journal of Data and Information Quality (JDIQ)
NADEEF: a commodity data cleaning system
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Editorial: Efficient discovery of similarity constraints for matching dependencies
Data & Knowledge Engineering
Extending inclusion dependencies with conditions
Theoretical Computer Science
Hi-index | 0.00 |
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically related values in terms of disjunction and inequality, and are capable of catching inconsistencies that arise in practice but cannot be detected by CFDs. The increase in expressive power does not incur extra complexity: we show that the satisfiability and implication analyses of eCFDs remain NP - complete and coNP -complete, respectively, the same as their CFDs counterparts. In light of the intractability, we present an algorithm that approximates the maximum number of eCFDs that are satisfiable. In addition, we revise SQL techniques for detecting CFD violations, and show that violations of multiple eCFDs can be captured via a single pair of SQL queries. We also introduce an incremental SQL technique for detecting eCFD violations in response to database updates. We experimentally verify the effectiveness and efficiency of our SQL -based detection methods.