DAFDiscover: Robust Mining Algorithm for Dynamic Approximate Functional Dependencies on Dirty Data
Summary: Introduces Dynamic Approximate Functional Dependencies (DAFDs), adapting relaxation to attribute error rates for semantically stronger dependency discovery on dirty data. DAFDiscover mines DAFDs with SOTA AFD complexity, backed by FD-equivalence, inference, probability, and validity-bound theory. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaoou Ding (Harbin Engineering University)
- 2. Yixing Lu (Harbin Engineering University)
- 3. Hongzhi Wang (Harbin Engineering University)
- 4. Chen Wang (Tsinghua University)
- 5. Yida Liu (Harbin Engineering University)
- 6. Jianmin Wang (Tsinghua University)
BibTeX Citation
@article{ding_vldb24,
title = {{DAFDiscover: Robust Mining Algorithm for Dynamic Approximate Functional Dependencies on Dirty Data}},
author = {Ding, Xiaoou and Lu, Yixing and Wang, Hongzhi and Wang, Chen and Liu, Yida and Wang, Jianmin},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {3484--3496},
doi = {10.14778/3681954.3682015},
url = {https://doi.org/10.14778/3681954.3682015},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,848 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 5.093636e-05 |
| 10,966 | UniClean: A Scalable Data Cleaning Solution for Mixed Errors based on Unified Cleaners and Optimized Cleaning Workflow | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 159 | CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies | 2004 | SIGMOD | 0.00028129426 |
| 618 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015711835 |
| 647 | Discovering Data Quality Rules | 2008 | VLDB | 0.00015334666 |
| 1,500 | Efficient Discovery of Approximate Dependencies | 2018 | VLDB | 0.00010561098 |
| 2,142 | Messing Up with BART: Error Generation for Evaluating Data-Cleaning Algorithms | 2016 | VLDB | 9.0975882e-05 |
| 3,441 | A Statistical Perspective on Discovering Functional Dependencies in Noisy Data | 2020 | SIGMOD | 7.4138323e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 203 | Dependency Inference | 1987 | VLDB |
| 2 | 2,123 | Discovery of Genuine Functional Dependencies from Relational Data with Missing Values | 2018 | VLDB |
| 3 | 7,099 | Discovering Graph Functional Dependencies | 2018 | SIGMOD |
| 4 | 7,187 | Discovery Algorithms for Embedded Functional Dependencies | 2020 | SIGMOD |
| 5 | 729 | Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms | 2015 | VLDB |
| 6 | 3,441 | A Statistical Perspective on Discovering Functional Dependencies in Noisy Data | 2020 | SIGMOD |
| 7 | 647 | Discovering Data Quality Rules | 2008 | VLDB |
| 8 | 618 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD |
| 9 | 9,923 | Efficient Differential Dependency Discovery | 2024 | VLDB |
| 10 | 10,848 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB |