Provenance-aware Discovery of Functional Dependencies on Integrated Views
Ugo Comignani, Laure Berti-Équille, Noël Novelli, Angela Bonifati
Abstract
The automatic discovery of functional dependencies (FDs) has been widely studied as one of the hardest problems in data profiling. Existing approaches have focused on making the FD computation efficient while inspecting single relations at a time. In this paper, for the first time we address the problem of inferring FDs for multiple relations as they occur in integrated views by solely using the functional dependencies of the base relations of the view itself. To this purpose, we leverage logical inference and selective mining and show that we can discover most of the exact FDs from the base relations and avoid the full computation of the FDs for the integrated view itself, while at the same time preserving the lineage of FDs of base relations. We propose algorithms to speedup the inferred FD discovery process and mine FDs on-the-fly only from necessary data partitions. We present InFine (INferred FunctIoNal dEpendency), an end-to-end solution to discover inferred FDs on integrated views by leveraging provenance information of base relations. Our experiments on a range of real-world and synthetic datasets demonstrate the benefits of our method over existing FD discovery methods that need to rerun the discovery process on the view from scratch and cannot exploit lineage information on the FDs. We show that InFine outperforms traditional methods necessitating the full integrated view computation by one to two order of magnitude in terms of runtime. It is also the most memory efficient method while preserving FD provenance information using mainly inference from base table with negligible execution time.
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 3e486be0-f44e-4841-8e1b-e88db9b228daBuilds on2
Related papers
- Discovering Functional Dependencies through Hitting Set EnumerationTobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck et al.SIGMOD 2024 · 9 citations
- Secure Multi-Party Functional Dependency DiscoveryChang Ge, Ihab F. Ilyas, Florian KerschbaumVLDB 2020 · 23 citations
- EulerFD: An Efficient Double-Cycle Approximation of Functional DependenciesQiongqiong Lin, Yunfan Gu, Jingyan Sai, Jinfei Liu et al.ICDE 2023 · 5 citations
- IndiBits: Incremental Discovery of Relaxed Functional Dependencies using Bitwise SimilarityBernardo Breve, Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia et al.ICDE 2023 · 7 citations
- Representative Functional DependenciesQiongqiong Lin, Jingyan Sai, Jiazheng Song, Jinfei Liu et al.ICDE 2026
