Discovery Algorithms for Embedded Functional Dependencies
Summary: eFD discovery is NP-complete and W[2]-hard in the output, with a larger minimum solution space than classical FDs. Row-, column-, and hybrid data structures with efficient search enable scalable eFD discovery; ranking by redundant values highlights meaningful eFDs and showcases completeness benefits for approximate and genuine FDs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ziheng Wei (University of Auckland)
- 2. Sven Hartmann (Clausthal University of Technology)
- 3. Sebastian Link (University of Auckland)
BibTeX Citation
@inproceedings{wei_sigmod20,
title = {{Discovery Algorithms for Embedded Functional Dependencies}},
author = {Wei, Ziheng and Hartmann, Sven and Link, Sebastian},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389786},
url = {https://dl.acm.org/doi/10.1145/3318464.3389786},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,303 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 6.1758652e-05 |
| 5,816 | Normalizing Property Graphs | 2023 | VLDB | 5.9678994e-05 |
| 9,997 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD | 5.0845476e-05 |
| 10,146 | Efficient Differential Dependency Discovery | 2024 | VLDB | 5.0597449e-05 |
| 11,318 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 602 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015670535 |
| 727 | Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms | 2015 | VLDB | 0.00014426954 |
| 1,490 | Efficient Discovery of Approximate Dependencies | 2018 | VLDB | 0.0001047928 |
| 2,131 | Discovery of Genuine Functional Dependencies from Relational Data with Missing Values | 2018 | VLDB | 8.9867472e-05 |
| 2,305 | GORDIAN: Efficient and Scalable Discovery of Composite Keys | 2006 | VLDB | 8.6550507e-05 |
| 3,479 | Embedded Functional Dependencies and Data-completeness Tailored Database Design | 2019 | VLDB | 7.2479083e-05 |
| 4,361 | Possible and Certain SQL Keys | 2015 | VLDB | 6.6271978e-05 |
| 8,285 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB | 5.3454563e-05 |
| 10,007 | SQL Schema Design: Foundations, Normal Forms, and Normalization | 2016 | SIGMOD | 5.0845476e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,131 | Discovery of Genuine Functional Dependencies from Relational Data with Missing Values | 2018 | VLDB |
| 2 | 6,929 | Efficient Discovery of XML Data Redundancies | 2006 | VLDB |
| 3 | 7,263 | Discovering Graph Functional Dependencies | 2018 | SIGMOD |
| 4 | 10,146 | Efficient Differential Dependency Discovery | 2024 | VLDB |
| 5 | 3,479 | Embedded Functional Dependencies and Data-completeness Tailored Database Design | 2019 | VLDB |
| 6 | 8,285 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB |
| 7 | 9,997 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD |
| 8 | 727 | Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms | 2015 | VLDB |
| 9 | 11,318 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB |
| 10 | 602 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD |