A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Functional and inclusion dependencies a graph theoretic approach
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Census Data Repair: a Challenging Application of Disjunctive Logic Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Theory of Data Dependencies - An Overview
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Clio grows up: from research prototype to industrial tool
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Query reformulation with constraints
ACM SIGMOD Record
Consistent query answering in databases
ACM SIGMOD Record
Putting context into schema matching
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Improving data quality: consistency and accuracy
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)
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On generating near-optimal tableaux for conditional functional dependencies
Proceedings of the VLDB Endowment
Discovering data quality rules
Proceedings of the VLDB Endowment
Incorporating cardinality constraints and synonym rules into conditional functional dependencies
Information Processing Letters
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Analyses and Validation of Conditional Dependencies with Built-in Predicates
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Composition and inversion of schema mappings
ACM SIGMOD Record
Discovering Conditional Functional Dependencies
IEEE Transactions on Knowledge and Data Engineering
Interaction between record matching and data repairing
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Dynamic constraints for record matching
The VLDB Journal — The International Journal on Very Large Data Bases
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICDT'07 Proceedings of the 11th international conference on Database Theory
Towards certain fixes with editing rules and master data
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Detection of Inconsistencies in Distributed Data
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Improving the Data Quality of Drug Databases using Conditional Dependencies and Ontologies
Journal of Data and Information Quality (JDIQ)
Discovering conditional inclusion dependencies
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 5.23 |
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends inclusion dependencies (INDs) by enforcing patterns of semantically related data values. We show that CINDs are useful not only in data cleaning, but also in contextual schema matching. We give a full treatment of the static analysis of CINDs, and show that CINDs retain most desired properties of traditional INDs: (a) CINDs are always satisfiable; (b) CINDs are finitely axiomatizable, i.e., there exists a sound and complete inference system for the implication analysis 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), as well as two practical fragments of CINDs, namely acyclic CINDs and unary CINDs. We show the following: (d) the satisfiability problem for the combination of CINDs and CFDs becomes undecidable, even in the absence of finite-domain attributes; (e) in the absence of finite-domain attributes, the implication problem for acyclic CINDs and for unary CINDs retains the same complexity as its traditional counterpart, namely, NP-complete and PTIME, respectively; but in the general setting, it becomes PSPACE-complete and coNP-complete, respectively; and (f) the implication problem for acyclic unary CINDs remains in PTIME in the absence of finite-domain attributes and coNP-complete in the general setting.