Database System ConceptsThis popular text in database systems is used in departments of computer science, computer engineering, and electrical engineering. The revision includes more material on SQL, relational models, logical databases, "QB" and "Datalog." |
From inside the book
Results 1-3 of 25
Page 192
Henry F. Korth, Abraham Silberschatz. 6.3 Normalization Using Multivalued Dependencies There are relation schemes that are in BCNF which do not seem to be sufficiently normalized in the sense that they still suffer from the problem of ...
Henry F. Korth, Abraham Silberschatz. 6.3 Normalization Using Multivalued Dependencies There are relation schemes that are in BCNF which do not seem to be sufficiently normalized in the sense that they still suffer from the problem of ...
Page 194
... multivalued dependency , we see that we want the multivalued dependency customer - name street customer - city to ... dependencies , we shall use multivalued dependencies in two ways : 1. To test relations to determine whether they are ...
... multivalued dependency , we see that we want the multivalued dependency customer - name street customer - city to ... dependencies , we shall use multivalued dependencies in two ways : 1. To test relations to determine whether they are ...
Page 198
... dependencies . The following fact about multivalued dependencies and lossless joins shows that the algorithm of Figure 6.13 generates only lossless - join decompositions : • Let R be a relation scheme and D a set of functional and ...
... dependencies . The following fact about multivalued dependencies and lossless joins shows that the algorithm of Figure 6.13 generates only lossless - join decompositions : • Let R be a relation scheme and D a set of functional and ...
Contents
Introduction | 1 |
EntityRelationship Model | 23 |
Relational Model | 53 |
Copyright | |
40 other sections not shown
Common terms and phrases
algorithm allows amount appear application attributes authorization balance bank block borrow branch branch-name bucket called Chapter commit compute concept concurrency consider consists constraints contains corresponding create customer-name data item database system deadlock decomposition defined definition delete dependencies deposit described diagram discussed disk distributed domain employees ensure entity set example execution exists expression failure Figure functional dependencies graph hash holds illustrate implementation insert Johnson join language loan lock manager modification node Note object operation performance Perryridge physical pointer possible presented processing protocol query record record type recovery references relation relational algebra relationship represent request require result rule schedule scheme serializability shows specify storage stored strategy structure Suppose T₁ techniques transaction tree tuples update variable write