The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Discovering denial constraints
Abstract
Integrity constraints (ICs) provide a valuable tool for enforcing correct application semantics. However, designing ICs requires experts and time. Proposals for automatic discovery have been made for some formalisms, such as functional dependencies and their extension conditional functional dependencies. Unfortunately, these dependencies cannot express many common business rules. For example, an American citizen cannot have lower salary and higher tax rate than another citizen in the same state. In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs). DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios. We lay out theoretical and practical foundations for DCs, including a set of sound inference rules and a linear algorithm for implication testing. We then develop an efficient instance-driven DC discovery algorithm and propose a novel scoring function to rank DCs for user validation. Using real-world and synthetic datasets, we experimentally evaluate scalability and effectiveness of our solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 3×
“Similar support measures are used for association rules [2].”
BackgroundMethodInfluential(2006) · Springer eBooks · Cited by 8,123
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming Data
Zikopoulos, P., & Eaton, C. (2011) · Cited by 1,455
Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Huhtala, Y. (1999) · The Computer Journal · doi:10.1093/comjnl/42.2.100 · Cited by 598
Conditional functional dependencies for capturing data inconsistencies
Fan, W., Geerts, F., Jia, X., & Kementsietsidis, A. (2008) · ACM Transactions on Database Systems · doi:10.1145/1366102.1366103 · Cited by 460
Conditional Functional Dependencies for Data Cleaning
Bohannon, P., Fan, W., Geerts, F., Jia, X., & Kementsietsidis, A. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367920 · Cited by 375
Holistic data cleaning: Putting violations into context
Chu, X., Ilyas, I. F., & Papotti, P. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544847 · Cited by 326
Self-citationCORDS: automatic discovery of correlations and soft functional dependencies
Ilyas, I. F., Markl, V., Haas, P., Brown, P., & Aboulnaga, A. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007641 · Cited by 315
Self-citationDiscovering data quality rules
Chiang, F., & Miller, R. J. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453980 · Cited by 265
Database Repairing and Consistent Query Answering
Bertossi, L. (2011) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01883-1 · Cited by 262
Discovering Conditional Functional Dependencies
Fan, W., Geerts, F., Li, J., & Xiong, M. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.154 · Cited by 253
Foundations of Data Quality Management
Fan, W., & Geerts, F. (2012) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01892-3 · Cited by 251
On generating near-optimal tableaux for conditional functional dependencies
Golab, L., Karloff, H., Korn, F., Srivastava, D., & Yu, B. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453900 · Cited by 200
Mining database structure; or, how to build a data quality browser
Dasu, T., Johnson, T. J., Muthukrishnan, S., & Shkapenyuk, V. (2002) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/564691.564719 · Cited by 191
Wyss, C., Giannella, C., & Robertson, E. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44801-2_11 · Cited by 170
Cited by
Data Cleaning: Overview and Emerging Challenges
Chu, X., Ilyas, I. F., Krishnan, S., & Wang, J. (2016) · Proceedings of the 2016 International Conference on Management of Data · doi:10.1145/2882903.2912574 · Cited by 488
Self-citationHoloClean: holistic data repairs with probabilistic inference
Rekatsinas, T., Chu, X., Ilyas, I. F., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137631 · Cited by 480
Self-citationData-centric Artificial Intelligence: A Survey
Zha, D., Bhat, Z. P., Lai, K.-H., Yang, F., Jiang, Z., Zhong, S., & Hu, X. (2025) · ACM Computing Surveys · doi:10.1145/3711118 · Cited by 334
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing
Chu, X., Morcos, J., Ilyas, I. F., Ouzzani, M., Papotti, P., Tang, N., & Ye, Y. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2749431 · Cited by 279
Self-citation
Metadata
- Authors
- Chu, X., Ilyas, I. F., & Papotti, P.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2013-08
- Volume
- 6
- Issue
- 13
- Pages
- 1498-1509
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2170712852
- Cited by
- 262
- References
- 17
- FWCI
- 11.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.