Prev | Current Page 396 | Next

Carl Reynolds and Paul Tymann

"Schaum's Outline of Principles of Computer Science"


Suppose that we created a relation with the attributes shown in Figure 8.3.
The key of the Student relation is the composite of Sname and Dorm (assuming that no students with the
same name will live in the same dorm).
This horizontal box representation is a common way to represent a relation??”vertical lines separate the
attribute names, and the attributes that comprise the key are underlined. The key attributes do not need to be adjacent
to one another, and they do not need to be on the left side, but often people choose to show them this way.
The key of any relation is always a determinant; by definition, the key identifies the entire tuple. Given
values for Sname and Dorm in the Student relation, the values for all the other attributes are determined.
Not all determinants are keys, however. In the Student relation, there is a functional dependency between
MajorAdvisorName and AdvisorDept. Given a value for the advisor name, the department value is determined.
First normal form is simply the definition of a relation. Each attribute must be an atomic, single-valued
attribute. For example, if an attribute in the Student relation is TelephoneNumber, any one tuple in the relation
can have only one value for TelephoneNumber.


Pages:
384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408
konstrukcje stalowe Paula Atherton ATC prezenty mieszkania szczecin