Sort sets in the relational model
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Practical algorithms for finding prime attributes and testing normal forms
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
The design of relational databases
The design of relational databases
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Semantic query optimization in Datalog programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The merge/purge problem for large databases
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning about qualitative trends in databases
Information Systems
Ordered functional dependencies in relational databases
Information Systems
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
An extension of the relational data model to incorporate ordered domains
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Applying approximate order dependency to reduce indexing space
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Sort sets in the relational model
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Trends in Databases: Reasoning and Mining
IEEE Transactions on Knowledge and Data Engineering
A Feasibility and Performance Study of Dependency Inference
Proceedings of the Fifth International Conference on Data Engineering
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
CORDS: automatic discovery of correlations and soft functional dependencies
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
Database dependency discovery: a machine learning approach
AI Communications
Leveraging aggregate constraints for deduplication
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Checks and balances: monitoring data quality problems in network traffic databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
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
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment
Discovering data quality rules
Proceedings of the VLDB Endowment
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Discovering Conditional Functional Dependencies
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Metric Functional Dependencies
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Reasoning about record matching rules
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Correlation maps: a compressed access method for exploiting soft functional dependencies
Proceedings of the VLDB Endowment
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
Comparable dependencies over heterogeneous data
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 importance of difference semantics (e.g., “similar” or “dissimilar”) has been recently recognized for declaring dependencies among various types of data, such as numerical values or text values. We propose a novel form of Differential Dependencies (dds), which specifies constraints on difference, called differential functions, instead of identification functions in traditional dependency notations like functional dependencies. Informally, a differential dependency states that if two tuples have distances on attributes X agreeing with a certain differential function, then their distances on attributes Y should also agree with the corresponding differential function on Y. For example, [date(≤ 7)]→[price( In this article, we first address several theoretical issues of differential dependencies, including formal definitions of dds and differential keys, subsumption order relation of differential functions, implication of dds, closure of a differential function, a sound and complete inference system, and minimal cover for dds. Then, we investigate a practical problem, that is, how to discover dds and differential keys from a given dataset. Due to the intrinsic hardness, we develop several pruning methods to improve the discovery efficiency in practice. Finally, through an extensive experimental evaluation on real datasets, we demonstrate the discovery performance and the effectiveness of dds in several real applications.