Lecture 8: Relational Data Model Flashcards
Formal term for table , column, and row is
relation, attribute, tuple
All possible column values are called
domain
table definition is
schema of a relation
populated table
state of the relation
a relation must have a key and we can not find one
we create one sequentially
key of a relation role is
uniquely identifies that row in the table
columns represents the attribute which gives…
meaning to the data
row is a representation if
certain facts that correspond to a real world entity or relationship
Schema of a relation is denoted by
R(A1,A2…,An)
Schema is database is denoted by
S={R1,R2,…,Rn}
-R is the relation schema
Tuples are not considered to be
ordered even though they appear to be in a tabular form
all values in a tuple are …
considered atomic
each value must be from the domain of the attribute (T or F)
T
A null represent
unknown or inapplicable to certain tuples
Constraints are conditions that must hold all valid relation states (t or f)
t
the three main types of constraints are
- key constraint
- entity integrity constraint
- referential integrity constraint
implicit constraint
is the domain constraint
superkey is a set
set of attributes SK of R with the following condition
(t or f) two tuples in any valid relation state can have the same value for superkey
f
a super key can be one or more (t or f)
t
a key is a
minimal superkey
any key is a superkey (t or f)
t
any set of attributes that includes a key is a superkey (t or f)
t
a minimal superkey is a key ( t or f)
t