Register

Recent questions tagged database-normalization

1 votes
2 answers
92
gradeup quiz question
please explain the question
please explain the question
User Avatar
0 votes
1 answer
94
Random college question paper
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependencies D→G, E→F and H→C, decompose the R into the highest normal form possible.
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependenciesD→G, E→F and H→C, decompose the R into the highest normal form possible.
User Avatar
1 votes
1 answer
99
NIELIT Scientific Assistant A 2020 November: 73
Anomalies are avoided by splitting the offending relation into multiple relations, is also known as __________. Accupressure Decomposition Precomposition Both decomposition & precomposition
Anomalies are avoided by splitting the offending relation into multiple relations, is also known as __________.AccupressureDecompositionPrecompositionBoth decomposition &...
User Avatar
2 votes
1 answer
100
NIELIT Scientific Assistant A 2020 November: 86
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called: Super Key Candidate Key Primary Key Both Candidate and Primary Key
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called:Super KeyCandidate KeyPrimary KeyBoth Candidate and Primary Key
User Avatar
1 votes
2 answers
101
NIELIT Scientific Assistant A 2020 November: 97
Domain constraints, functional dependency and referential integrity are special forms of _______ Foreign key Primary key Assertion Referential constraint
Domain constraints, functional dependency and referential integrity are special forms of _______Foreign keyPrimary keyAssertionReferential constraint
User Avatar
4 votes
3 answers
103
NIELIT 2016 MAR Scientist B - Section C: 43
Let $R=(A,B,C,D,E,F)$ be a relation scheme with the following dependencies: $C\to F,E\to a,EC\to D, A\to B$. Which of the following is a key for $R$? $CD$ $EC$ $AE$ $AC$
Let $R=(A,B,C,D,E,F)$ be a relation scheme with the following dependencies:$C\to F,E\to a,EC\to D, A\to B$.Which of the following is a key for $R$?$CD$$EC$$AE$$AC$
User Avatar
0 votes
2 answers
105
NIELIT 2016 DEC Scientist B (IT) - Section B: 14
Normalization from which is based on transitive dependency is classified as: First normal form. Second normal form. Fourth normal form. Third normal form.
Normalization from which is based on transitive dependency is classified as:First normal form.Second normal form.Fourth normal form.Third normal form.
User Avatar
0 votes
2 answers
106
NIELIT 2016 DEC Scientist B (IT) - Section B: 40
In functional dependency between two sets of attribute $A$ and $B$ then set of attributes $A$ of database is classified as: top right side down left side left hand side right hand side
In functional dependency between two sets of attribute $A$ and $B$ then set of attributes $A$ of database is classified as:top right sidedown left sideleft hand sideright...
User Avatar
1 votes
2 answers
108
NIELIT 2016 DEC Scientist B (IT) - Section B: 57
If attribute of relation schema $R$ is member of some candidate key then this type of attributes are classified as: atomic attribute candidate attribute non-prime attribute prime attribute
If attribute of relation schema $R$ is member of some candidate key then this type of attributes are classified as:atomic attributecandidate attributenon-prime attributep...
User Avatar
1 votes
2 answers
109
NIELIT 2016 DEC Scientist B (CS) - Section B: 2
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as:normalization of data.denomination of data.isolatio...
User Avatar
4 votes
3 answers
110
NIELIT 2016 DEC Scientist B (CS) - Section B: 31
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified as referential rule inferential rule augmentation rule reflexive rule
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified asreferential ruleinferential ruleaugme...
User Avatar
1 votes
2 answers
111
NIELIT 2016 DEC Scientist B (CS) - Section B: 47
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as $FD$ is covered by $E$ $E$ is covered by $F$ $F$ is covered by $E$ $F$ plus is covered by $E$
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as$FD$ is covered by $E$$E$ is covered by $F$$F$ is covered by $E$$F$ plus is ...
User Avatar
2 votes
2 answers
112
NIELIT 2016 DEC Scientist B (CS) - Section B: 49
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by $A\to B$ $B\gets A$ $AB\to R$ $R\gets AB$
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by$A\to B$$B\gets A$$AB\to R$$R\gets AB$
User Avatar
0 votes
4 answers
115
NIELIT 2017 DEC Scientist B - Section B: 25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
User Avatar
3 votes
4 answers
116
NIELIT 2017 DEC Scientist B - Section B: 55
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NF BCNF $3$NF $1$NF
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NFBCN...
User Avatar
Page: