LIS 558 - Relational database design
Given n sets D1, D2, D3, ...DN,
R is a relation over these sets
if R is a set of ordered n-tuples
of the form <d1, d2, ..., dn>,
where d1 is an element from D1, etc.
D1, D2, ...DN are called the domains of
The primary key is that attribute
or set of attributes (composite key)
which is used to uniquely identify one tuple from another.
A relational database is a collection of relations
for an application with some normalization.
Goals of database design
- Have the capability of storing all pertinent data in the
- Eliminate redundant data.
- Keep the number of relations to a minimum.
- Have the relations normalized,
so as to minimize insertion, update, and deletion problems.
Last updated July 5, 2001.
This page maintained by
Prof. Tim Craven
E-mail (text/plain only): email@example.com
Faculty of Information and
University of Western
Canada, N6A 5B7