Register

NIELIT 2016 DEC Scientist B (CS) - Section B: 2

• retagged by
3,890 views

2 Answers

2 votes
2 votes
Using normalization we try to achieve minimal functional dependency and remove data redundancy and improve data integrity (insertion anomaly, update anomaly & deletion anomaly.)

So A is correct.
User Avatar
0 votes
0 votes
Ans : A

Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data .
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
3 answers
1
admin asked Mar 31, 2020
2,750 views
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
1 votes
2 answers
2
admin asked Mar 31, 2020
1,706 views
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 votes
2 answers
3
admin asked Mar 31, 2020
2,448 views
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
0 votes
1 answer
4
admin asked Mar 31, 2020
2,852 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 54
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as prime key super key candidate key primary key
If there is more than one key for relation schema in DBMS then each key in relation schema is classified asprime keysuper keycandidate keyprimary key
User Avatar
Link Copied!