Measuring Approximate Functional Dependencies: A Comparative Study
Marcel Parciak, Sebastiaan Weytjens, Niel Hens, Frank Neven, Liesbet M. Peeters, Stijn Vansummeren
Abstract
Approximate functional dependencies (AFDs) are functional dependencies (FDs) that “almost” hold in a relation. While various measures have been proposed to quantify the level to which an FD holds approximately, they are difficult to compare and it is unclear which measure is preferable when one needs to discover FDs in real-world data, i.e., data that only approximately satisfies the FD. In response, this paper formally and qualitatively compares AFD measures. We obtain a formal comparison through a novel presentation of measures in terms of Shannon and logical entropy. Qualitatively, we perform a sensitivity analysis w.r.t. structural properties of input relations and quantitatively study the effectiveness of AFD measures for ranking AFDs on real world data. Based on this analysis, we give clear recommendations for the AFD measures to use in practice.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d7f4fe40-07c1-4f53-b787-0907bcc947c0Cited by top-tier papers4
- Discovering Top-k Relevant and Diversified RulesWenfei Fan, Ziyan Han, Min Xie, Guangyi ZhangSIGMOD 2025 · 2 citations
- Discovering Approximate Denial Constraints in Large DatabasesAlbert Martin, Eduardo C. de Almeida, Oscar Romero, Anna QueraltVLDB 2026 · 2 citations
- How and Why False Denial Constraints are DiscoveredAlbert Martin, Eduardo C. de Almeida, Oscar Romero, Anna QueraltVLDB 2025 · 1 citation
- Storage-Centric Relation Design via High-Quality Approximate Functional DependenciesRui Ding, Xiaochun Yang, Bin Wang, Quanqing Xu et al.VLDB 2026
Builds on5
- Discovery of Approximate (and Exact) Denial ConstraintsEduardo H. M. Pena, Eduardo C. de Almeida, Felix NaumannVLDB 2020 · 79 citations
- A Statistical Perspective on Discovering Functional Dependencies in Noisy DataYunjia Zhang, Zhihan Guo, Theodoros RekatsinasSIGMOD 2020 · 45 citations
- Hitting Set Enumeration with Partial Information for Unique Column Combination DiscoveryJohann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann et al.VLDB 2020 · 35 citations
- Discovering Approximate Functional Dependencies using Smoothed Mutual InformationFrédéric Pennerath, Panagiotis Mandros, Jilles VreekenKDD 2020 · 13 citations
- Assessing the Existence of a Function in a Dataset with the g3 IndicatorPierre Faure-Giovagnoli, Jean-Marc Petit, Vasile-Marian ScuturiciICDE 2022 · 4 citations
Related papers
- Anytime Algorithms for Approximate Functional DependenciesSanjivni Rana, Junya Ogawa, Suraj Shetiya, Senjuti Basu Roy et al.KDD 2025
- DAFDiscover: Robust Mining Algorithm for Dynamic Approximate Functional Dependencies on Dirty DataXiaoou Ding, Yixing Lu, Hongzhi Wang, Chen Wang et al.VLDB 2024 · 4 citations
- Approximate Order Dependency DiscoveryYifeng Jin, Zijing Tan, Weijun Zeng, Shuai MaICDE 2021 · 7 citations
- IndiBits: Incremental Discovery of Relaxed Functional Dependencies using Bitwise SimilarityBernardo Breve, Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia et al.ICDE 2023 · 7 citations
- Discovering Approximate Inclusion DependenciesQingdong Su, Zhikang Wang, Zijing Tan, Shuai MaVLDB 2025
