Functional Dependency Inference is a formal method in relational database theory that systematically derives new functional dependencies from a given set of functional dependencies using inference rules such as reflexivity, augmentation, and transitivity.
78
Publications
4.8K
Citations
147
Authors
85
Institutions
Publications per year
2017–2026
12
Parents
Publications
78
Algorithms for acyclic database schemes
Mihalis Yannakakis · Very Large Data Bases · 1981 · 500 citations
Conditional Functional Dependencies for Data Cleaning
Philip Bohannon, Wenfei Fan, Floris Geerts et al. · 2007 · 372 citations · Full text
1–5 of 78
Authors
147
- JP
4
h-index
- HM
4
h-index
- KR
3
h-index
- WF
3
h-index
- FG
3
h-index
1–5 of 147
Institutions
85
IBM (United States)
Armonk, United States
4 h-index
6 publications
1.3K citations
University of Edinburgh
Edinburgh, United Kingdom
4 h-index
11 publications
3.6K citations
University of Helsinki
Helsinki, Finland
4 h-index
5 publications
859 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
9 publications
248 citations
Princeton University
Princeton, United States
3 h-index
3 publications
412 citations
TU Dortmund University
Dortmund, Germany
3 h-index
3 publications
87 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
3 publications
96 citations
Tampere University
Tampere, Finland
3 h-index
5 publications
587 citations
1–8 of 85
Venues
- Proceedings of the VLDB Endowment
PVLDB · 5 publications · 396 citations
5
h-index
- International Journal of Intelligent Systems
3 publications · 123 citations
3
h-index
- ACM Transactions on Database Systems
TODS · 3 publications · 560 citations
3
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 3 publications · 132 citations
3
h-index
- Theoretical Computer Science
2 publications · 275 citations
2
h-index
1–5