Database Paper Browser

Back to papers

DAFDiscover: Robust Mining Algorithm for Dynamic Approximate Functional Dependencies on Dirty Data

Summary: DAFD: dynamic AFDs that model per-attribute error rates and map bijectively to classical FDs, with a sound, complete inference system. DAFDiscover mines DAFDs directly on dirty data with provable correctness, computable DAFD-prob and validity lower bound, matching SOTA complexity while improving semantic accuracy. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13558
Venue
VLDB
Year
2024
Pagerank
4.3109001e-05
Overall Rank
9,649 | 32.88%
DOI
10.14778/3681954.3682015

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers