Database Paper Browser

Back to papers

Logical Design of Relational Database Schemes

Summary: Introduce extended conflict-free (ECF) cover and prove: for FDs+MVDs an acyclic, dependency-preserving 4NF decomposition exists iff the dependency set has an ECF cover. Provide polynomial-time test and construction; specializes to FDs giving iff condition for acyclic, dependency-preserving BCNF. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
776
Venue
PODS
Year
1987
Pagerank
4.1905499e-05
Overall Rank
12,983 | 9.77%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,051 A Normal Form for Nested Relations 1985 PODS 0.00014421811
3,096 Database Decomposition Into Fourth Normal Form 1983 VLDB 7.5755731e-05
9,118 Unifying Functional and Multivalued Dependencies for Relational Database Design 1986 PODS 4.388537e-05
Previous Page 1 / 1 Next

Semantically Similar Papers