0
Boyce -Codd normal form which is one of the forms of dbms noramlizations.normalization is converting the relations or tables in a standard form.bcnf is based on functional dependencies that take into account all candidate keys.a relation is in bcnf if every determinant has a candidate key..:)
What else can I help you with?
What is bcnf explain with example?
define BCNF. Explain with appropriate example
What is overlapping key DBMS?
Overlapping Key is a type of candidate key which occurs in BCNF (Boyce –Codd Normal Form).In the difference between 3NF and BCNF Example : A 3NF table which does not have multiple overlapping candidate keys is guaranteed to be in BCNF. Depending on what its functional dependencies are, a 3NF table with two or more overlapping candidate keys may or may not be in BCNF.
Explain the link between hardware and application software?
DBMS
What is the difference between 3NF and BCNF?
Boyce-codd normal form(BCNF) was proposed as a simpler form of 3NF,but it was found to be stricter than 3NF,because every relation in BCNF is also in 3NF.However a relation in 3NF is not necessarily in BCNF.
Boyce-Codd normal form BCNF?
Yes, acronym BCNF stands for 'Boyce-Codd Normal Form'.
Explain the centralized DBMS architecture in detail?
combines everything into a single system including, DBMS software,hardware, application programs and user interface
Draw a neat diagram of components of DBMS and explain?
errjklerjqlwrjqwewqerlkwrlqewlrkqwerqewrqwklrjqweklodo tari ma no chodu
Explain the types of dbms users?
There are four types of DBMS users,Naive UsersOnline UsersApplication Program UsersDatabase AdministratorNote: The description of above points is currently not available.
Is a relation in bcnf always in 3nf?
Yes.
Why bcnf is stronger than 3nf?
A relation R is in 3NF if and only if every dependency A->B satisfied by R meets at least ONE of the following criteria: 1. A->B is trivial (i.e. B is a subset of A) 2. A is a superkey 3. B is a subset of a candidate key BCNF doesn't permit the third of these options. Therefore BCNF is said to be stronger than 3NF because 3NF permits some dependencies which BCNF does not.
Explain the three schema architecture of DBMS?
Physical schema,logical schema and sub schemas
Why 4NF is preferable then bcnf .with example?
Normalization is a process to reduce the redundancy by removing function dependencies BCNF (Boyece code normal form) has all functional dependencies A to B are trivial of discriminator should be superkey. To get relation in BCNF, Splitting the relation schema not neccessarily preserve all functional dependency, Loss less decomposition and dependency are main points for the normalization sometime, it is not possible to get a BCNF decomposition that is dependency, preserving. While 4NF has very similar definition as BCNF. A relational Schema is in 4NF, if all multivalued dependencies A to B are trivial and determinate A is superkey of schema. If a relational schema is in 4nf, it is already in BCNF. and 4NF decomposition preserve the all functional dependency. so 4NF is preferable than to have BCNF.
