Database Paper Browser

Back to papers

Computing Covers for Embedded Functional Dependencies

Summary: Computes covers for functional dependencies embedded in a sub-schema and presents Reduction By Resolution (RBR), an algorithm that simplifies solving embedded-FD cover problems. Although worst-case exponential, RBR is polynomial on many input classes and enables BCNF testing and decomposition. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
778
Venue
PODS
Year
1987
Pagerank
6.160725e-05
Overall Rank
4,463 | 68.96%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,781 Practical algorithms for finding prime attributes and testing normal forms 1989 PODS 5.3298267e-05
6,385 Propagating Functional Dependencies with Conditions 2008 VLDB 5.0875028e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
170 A Complete Axiomatization For Functional And Multivalued Dependencies In Database Relations 1977 SIGMOD 0.0003886136
3,111 Reflections on Boyce-Codd Normal Form 1982 VLDB 7.5474137e-05
Previous Page 1 / 1 Next

Semantically Similar Papers