New answers tagged databases
0
Second normal form means that each non prime attribute must not depend on a proper subset of a candidate key.
In your example, assuming that the given FDs are a cover of the FDs of the relation, you have two candidate keys, ABC and ABD. Moreover, the attribute E depends on BC, which is a proper subset of the candidate key ABC (you can verify this by ...
1
Databases have some issues that "mere mortal" data storage doesn't concern itself with, such as transaction safety and disk failure.
Here are a few classic papers on the topic:
Astrahan et al (1976), System R: A Relational Approach to Data Base Management, ACM TOMS 1:2, pp 97-137.
Stonebreaker et al (1976), The Design and Implementation of INGRES, ...
1
X -> Y non-trivial means that X does not include Y. Since Y is a prime attribute, we know that there is at least a candidate key that include it. Let's call this key K1.
Now we have two cases: either X is a superkey, or not.
If X is a superkey, then it contains at least a candidate key K. We can easily convince that K ≠ K1, since it differ from K1 by at ...
Top 50 recent answers are included
Related Tags
databases × 191database-theory × 86
relational-algebra × 22
data-structures × 21
concurrency × 16
algorithms × 13
distributed-systems × 11
trees × 7
normal-forms × 7
terminology × 6
reference-request × 6
search-algorithms × 5
functional-dependencies × 5
optimization × 4
modelling × 4
filesystems × 4
data-sets × 4
graphs × 3
search-trees × 3
data-mining × 3
relational-calculus × 3
tuple-relational-calculus × 3
database-concurrency × 3
transactions × 3
compilers × 2