R ∩ S = ((R ∪ S ) − (R − S )) − (S − R)

For the Cartesian product to be defined, the two relations involved must have disjoint headers—that is, they must not have a common attribute name

CARTESIAN PRODUCT operation applied by itself is generally meaningful .

DIVISION operation is a binary relational operation that divides one set of rows into another set of rows based on specified conditions

DIVISION general form is R÷ S to apply this operation the relation S must be subset of Relation R.

U = R x S then U ÷ S =

U = R x S then U ÷ R =

U = R x S then R ÷ U =

How the tuples in a base relation are stored and updated

How users interpret the relation schemas and the meaning of their attributes

logical level =

physical storage level =

One goal of schema design is to … the storage space used by the base relations (and hence the
corresponding files).

into relation schemas has a significant effect on storage space

When information is stored redundantly, this will lead to

Update anomalies

Insertion anomalies can be differentiated into … types

The problem of deletion anomalies is related to the second insertion anomaly situation just discussed.

.........is the process of organizing data in a database

Goal of Normalization