Skip to search formSkip to main contentSkip to account menu

Boyce–Codd normal form

Known as: BCNF, Boyce-Codd normal form, 3.5NF 
Boyce–Codd normal form (or BCNF or 3.5NF) is a normal form used in database normalization. It is a slightly stronger version of the third normal form… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large… 
2009
2009
  • M. Arenas
  • 2009
  • Corpus ID: 42697224
Potential problem with 3NF-R is in 3NF although Prof S# Prof C#, since no non-prime attribute exists (no transitive dependency… 
2006
2006
It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal… 
1987
1987
함수적 종속들을 가지고 Boyce-Codd 정규형(BCNF) 릴레이션 스키머를 생성하는 BCNF 생성기(Boyce-Codd Normal Form Generator)를 UNIX 환경하에서 C 언어로 구현하였다. 효율적인 BCNF… 
1982
1982
Decomposition into Boyce-Codd Normal Form (BCNF) with a lossless join and preservation of dependencies is desired in the design… 
Highly Cited
1980
Highly Cited
1980
Normalization research has concentrated on defining normal forms for database schemas and developing efficient algorithms for… 
1980
1980
Decomposition into Boyce-Codd Normal Form (BCNF) with a lossless join and preservation of dependencies is desired in the design… 
Highly Cited
1979
Highly Cited
1979
Problems related to functional dependencies and the algorithmic design of relational schemas are examined. Specifically, the… 
Highly Cited
1977
Highly Cited
1977
A new type of dependency, which includes the well-known functional dependencies as a special case, is defined for relational…