The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Conditional Functional Dependencies for Data Cleaning
Open accessAbstract
We propose a class of constraints, referred to as conditional functional dependencies (CFDs), and study their applications in data cleaning. In contrast to traditional functional dependencies (FDs) that were developed mainly for schema design, CFDs aim at capturing the consistency of data by incorporating bindings of semantic ally related values. For CFDs we provide an inference system analogous to Armstrong's axioms for FDs, as well as consistency analysis. Since CFDs allow data bindings, a large number of individual constraints may hold on a table, complicating detection of constraint violations. We develop techniques for detecting CFD violations in SQL as well as novel techniques for checking multiple constraints in a single query. We experimentally evaluate the performance of our CFD-based methods for inconsistency detection. This not only yields a constraint theory for CFDs but is also a step toward a practical constraint-based method for improving data quality.
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
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
(1995) · Choice Reviews Online · doi:10.5860/choice.33-0359 · Cited by 1,754
(2000) · Cited by 1,467
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Consistent query answers in inconsistent databases
Arenas, M., Bertossi, L., & Chomicki, J. (1999) · Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/303976.303983 · Cited by 868
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Hernández, M. A., & Stolfo, S. J. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009761603038 · Cited by 812
Potter's Wheel: An Interactive Data Cleaning System
Raman, V., & Hellerstein, J. L. (2001) · Cited by 492
A cost-based model and effective heuristic for repairing constraints by value modification
Bohannon, P., Fan, W., Flaster, M., & Rastogi, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066175 · Cited by 424
Self-citationMinimal-change integrity maintenance using tuple deletions
Chomicki, J., & Marcinkowski, J. (2005) · Information and Computation · doi:10.1016/j.ic.2004.04.007 · Cited by 347
AJAX: an extensible data cleaning tool
Galhardas, H., Florescu, D., Shasha, D., & Simon, E. (2000) · ACM SIGMOD Record · doi:10.1145/335191.336568 · Cited by 174
Enterprise information portals
White, M. (2000) · The Electronic Library · doi:10.1108/02640470010354617 · Cited by 160
Minimum Covers in Relational Database Model
Maier, D. (1980) · Journal of the ACM · doi:10.1145/322217.322223 · Cited by 134
Matching Algorithms within a Duplicate Detection System.
Monge, A. E. (2000) · IEEE Data(base) Engineering Bulletin · Cited by 101
Enterprise information portals
White, M. (2018) · Facet eBooks · doi:10.29085/9781856049832.015 · Cited by 38
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
HoloClean: 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
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
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
Managing and Mining Uncertain Data
(2009) · Advances in Database Systems · doi:10.1007/978-0-387-09690-2 · Cited by 287
Metadata
- Authors
- Bohannon, P., Fan, W., Geerts, F., Jia, X., & Kementsietsidis, A.
- Venue
- 2007 IEEE 23rd International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- 746-755
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2153531471
- Cited by
- 375
- References
- 14
- FWCI
- 28.36
- Type
- conference paper
- Language
- en
- Open access
- green
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.