The Relational Model

Chapter 3

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Why Study the Relational Model?

Most widely used model.

Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc.

Legacy systems in older models

E.G., IBMs IMS

Recent competitor: object-oriented model

ObjectStore, Versant, Ontos A synthesis emerging: object-relational model

Informix Universal Server, UniSQL, O2, Oracle, DB2

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Relational Database: Definitions

Relational database: a set of relations Relation: made up of 2 parts:

Instance : a table, with rows and columns. # Rows = cardinality, # fields = degree / arity. Schema : specifies name of relation, plus name and type of each column.
E.G. Students(sid: string, name: string, login: string, age: integer, gpa: real).

Can think of a relation as a set of rows or tuples (i.e., all rows are distinct).
3

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Example Instance of Students Relation

sid name login age 18 18 19 gpa 3.4 3.2 3.8

53666 Jones jones@cs 53688 Smith smith@eecs 53650 Smith smith@math

Cardinality = 3, degree = 5, all rows distinct

Do all columns in a relation instance have to be distinct?

4

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Relational Query Languages

A major strength of the relational model: supports simple, powerful querying of data. Queries can be written intuitively, and the DBMS is responsible for efficient evaluation.

The key: precise semantics for relational queries. Allows the optimizer to extensively re-order operations, and still ensure that the answer does not change.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

The SQL Query Language

Developed by IBM (system R) in the 1970s Need for a standard since it is used by many vendors Standards:

SQL-86 SQL-89 (minor revision) SQL-92 (major revision) SQL-99 (major extensions, current standard)

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

The SQL Query Language

To find all 18 year old students, we can write:

SELECT * FROM Students S WHERE [Link]=18

sid

name

login jones@cs

age gpa 18 3.4 3.2

53666 Jones

53688 Smith smith@ee 18

To find just names and logins, replace the first line:

SELECT

[Link], [Link]

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Querying Multiple Relations

What does the following query compute?

SELECT [Link], [Link] FROM Students S, Enrolled E WHERE [Link]=[Link] AND [Link]=A

Given the following instance of Enrolled (is this possible if the DBMS ensures referential integrity?): we get:

sid 53831 53831 53650 53666

cid grade Carnatic101 C Reggae203 B Topology112 A History105 B

[Link] [Link] Smith Topology112

8

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Creating Relations in SQL

Creates the Students CREATE TABLE Students (sid: CHAR(20), relation. Observe that the name: CHAR(20), type (domain) of each field login: CHAR(10), is specified, and enforced by age: INTEGER, the DBMS whenever tuples gpa: REAL) are added or modified. As another example, the CREATE TABLE Enrolled Enrolled table holds (sid: CHAR(20), information about courses cid: CHAR(20), that students take. grade: CHAR(2))
9

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Destroying and Altering Relations

DROP TABLE Students

Destroys the relation Students. The schema information and the tuples are deleted.
ALTER TABLE Students ADD COLUMN firstYear: integer

The schema of Students is altered by adding a new field; every tuple in the current instance is extended with a null value in the new field.
10

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Adding and Deleting Tuples

Can insert a single tuple using:

INSERT INTO Students (sid, name, login, age, gpa) VALUES (53688, Smith, smith@ee, 18, 3.2)

Can delete all tuples satisfying some condition (e.g., name = Smith):
DELETE FROM Students S WHERE [Link] = Smith

* Powerful variants of these commands are available; more later!

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 11

Integrity Constraints (ICs)

IC: condition that must be true for any instance of the database; e.g., domain constraints.

ICs are specified when schema is defined. ICs are checked when relations are modified.

A legal instance of a relation is one that satisfies all specified ICs.

DBMS should not allow illegal instances.

If the DBMS checks ICs, stored data is more faithful to real-world meaning.

Avoids data entry errors, too!

12

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Primary Key Constraints

A set of fields is a key for a relation if :

1. No two distinct tuples can have same values in all key fields, and 2. This is not true for any subset of the key. Part 2 false? A superkey. If theres >1 key for a relation, one of the keys is chosen (by DBA) to be the primary key.

E.g., sid is a key for Students. (What about name?) The set {sid, gpa} is a superkey.
13

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Primary and Candidate Keys in SQL

UNIQUE), one of which is chosen as the primary key.

Possibly many candidate keys (specified using

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

For a given student and course, CREATE TABLE Enrolled (sid CHAR(20) there is a single grade. vs. cid CHAR(20), Students can take only one grade CHAR(2), course, and receive a single grade PRIMARY KEY (sid,cid) ) for that course; further, no two CREATE TABLE Enrolled students in a course receive the (sid CHAR(20) same grade. cid CHAR(20), Used carelessly, an IC can prevent grade CHAR(2), the storage of database instances PRIMARY KEY (sid), that arise in practice! UNIQUE (cid, grade) )

14

Foreign Keys, Referential Integrity

Foreign key : Set of fields in one relation that is used to `refer to a tuple in another relation. (Must correspond to primary key of the second relation.) Like a `logical pointer. E.g. sid is a foreign key referring to Students:

Enrolled(sid: string, cid: string, grade: string) If all foreign key constraints are enforced, referential integrity is achieved, i.e., no dangling references. Can you name a data model w/o referential integrity?
Links in HTML!
15

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Foreign Keys in SQL

Only students listed in the Students relation should be allowed to enroll for courses.
CREATE TABLE Enrolled (sid CHAR(20), cid CHAR(20), grade CHAR(2), PRIMARY KEY (sid,cid), FOREIGN KEY (sid) REFERENCES Students )

Enrolled
sid 53666 53666 53650 53666 cid grade Carnatic101 C Reggae203 B Topology112 A History105 B

Students
sid name login age 18 18 19 gpa 3.4 3.2 3.8
16

53666 Jones jones@cs 53688 Smith smith@eecs 53650 Smith smith@math

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Enforcing Referential Integrity

Consider Students and Enrolled; sid in Enrolled is a foreign key that references Students. What should be done if an Enrolled tuple with a non-existent student id is inserted? (Reject it!) What should be done if a Students tuple is deleted?

Also delete all Enrolled tuples that refer to it. Disallow deletion of a Students tuple that is referred to. Set sid in Enrolled tuples that refer to it to a default sid. (In SQL, also: Set sid in Enrolled tuples that refer to it to a special value null, denoting `unknown or `inapplicable .)

Similar if primary key of Students tuple is updated.

17

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Referential Integrity in SQL

SQL/92 and SQL:1999 CREATE TABLE Enrolled support all 4 options on (sid CHAR(20), deletes and updates. cid CHAR(20), grade CHAR(2), Default is NO ACTION PRIMARY KEY (sid,cid), (delete/update is rejected) FOREIGN KEY (sid) CASCADE (also delete REFERENCES Students all tuples that refer to ON DELETE CASCADE deleted tuple) ON UPDATE SET DEFAULT ) SET NULL / SET DEFAULT (sets foreign key value of referencing tuple)

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

18

Where do ICs Come From?

ICs are based upon the semantics of the realworld enterprise that is being described in the database relations. We can check a database instance to see if an IC is violated, but we can NEVER infer that an IC is true by looking at an instance.

An IC is a statement about all possible instances! From example, we know name is not a key, but the assertion that sid is a key is given to us.

Key and foreign key ICs are the most common; more general ICs supported too.
19

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Logical DB Design: ER to Relational

Entity sets to tables:

CREATE TABLE Employees (ssn CHAR(11), name CHAR(20), lot INTEGER, PRIMARY KEY (ssn))

ssn

name

lot

Employees

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

20

Relationship Sets to Tables

In translating a relationship set to a relation, attributes of the relation must include: Keys for each participating entity set (as foreign keys). This set of attributes forms a superkey for the relation. All descriptive attributes.

CREATE TABLE Works_In( ssn CHAR(1), did INTEGER, since DATE , PRIMARY KEY (ssn, did), FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments)

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

21

Review: Key Constraints

since

Each dept has at most one manager, according to the key constraint on Manages.

name ssn lot did

dname budget

Employees

Manages

Departments

Translation to relational model?

1-to-1 1-to Many Many-to-1 Many-to-Many
22

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Translating ER Diagrams with Key Constraints

Map relationship to a table: Note that did is the key now! Separate tables for Employees and Departments. Since each department has a unique manager, we could instead combine Manages and Departments.

CREATE TABLE Manages( ssn CHAR(11), did INTEGER, since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments)

CREATE TABLE Dept_Mgr(

did INTEGER, dname CHAR(20), budget REAL, ssn CHAR(11), since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees)
23

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Review: Participation Constraints

Does every department have a manager?

If so, this is a participation constraint: the participation of Departments in Manages is said to be total (vs. partial). Every did value in Departments table must appear in a row of the Manages table (with a non-null ssn value!)
name ssn Employees lot Manages since dname did budget Departments

Works_In

since Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

24

Participation Constraints in SQL

We can capture participation constraints involving one entity set in a binary relationship, but little else (without resorting to CHECK constraints).
CREATE TABLE Dept_Mgr( did INTEGER, dname CHAR(20), budget REAL, ssn CHAR(11) NOT NULL, since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees, ON DELETE NO ACTION)
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 25

Review: Weak Entities

A weak entity can be identified uniquely only by considering the primary key of another (owner) entity.

Owner entity set and weak entity set must participate in a one-to-many relationship set (1 owner, many weak entities). Weak entity set must have total participation in this identifying relationship set.
name ssn lot cost pname age

Employees

Policy

Dependents

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

26

Translating Weak Entity Sets

Weak entity set and identifying relationship set are translated into a single table.

When the owner entity is deleted, all owned weak entities must also be deleted. CREATE TABLE Dep_Policy ( pname CHAR(20), age INTEGER, cost REAL, ssn CHAR(11) NOT NULL, PRIMARY KEY (pname, ssn), FOREIGN KEY (ssn) REFERENCES Employees, ON DELETE CASCADE)
27

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

name ssn

Review: ISA Hierarchies

hourly_wages hours_worked

lot

Employees

As in C++, or other PLs, attributes are inherited. If we declare A ISA B, every A entity is also considered to be a B entity.

ISA contractid

Hourly_Emps

Contract_Emps

Overlap constraints: Can Joe be an Hourly_Emps as well as a Contract_Emps entity? (Allowed/disallowed) Covering constraints: Does every Employees entity also have to be an Hourly_Emps or a Contract_Emps entity? (Yes/no)
28

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Translating ISA Hierarchies to Relations

General approach:

3 relations: Employees, Hourly_Emps and Contract_Emps. Hourly_Emps: Every employee is recorded in Employees. For hourly emps, extra info recorded in Hourly_Emps (hourly_wages, hours_worked, ssn); must delete Hourly_Emps tuple if referenced Employees tuple is deleted). Queries involving all employees easy, those involving just Hourly_Emps require a join to get some attributes.

Alternative: Just Hourly_Emps and Contract_Emps.

Hourly_Emps: ssn, name, lot, hourly_wages, hours_worked. Each employee must be in one of these two subclasses.
29

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Review: Binary vs. Ternary Relationships ssn name

lot Employees

pname

age

Covers Policies policyid cost

Dependents

What are the additional constraints in the 2nd diagram?

Bad design

name ssn Employees Purchaser lot

pname

age

Dependents

Beneficiary

Better design
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Policies cost
30

policyid

CREATE TABLE Policies ( The key policyid INTEGER, constraints allow cost REAL, us to combine ssn CHAR(11) NOT NULL, Purchaser with PRIMARY KEY (policyid). Policies and FOREIGN KEY (ssn) REFERENCES Employees, Beneficiary with ON DELETE CASCADE) Dependents. Participation CREATE TABLE Dependents ( constraints lead to pname CHAR(20), NOT NULL age INTEGER, constraints. policyid INTEGER, What if Policies is PRIMARY KEY (pname, policyid). a weak entity set? FOREIGN KEY (policyid) REFERENCES Policies, ON DELETE CASCADE)
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 31

Binary vs. Ternary Relationships (Contd.)

Views

A view is just a relation, but we store a definition, rather than a set of tuples.
CREATE VIEW YoungActiveStudents (name, grade) AS SELECT [Link], [Link] FROM Students S, Enrolled E WHERE [Link] = [Link] and [Link]<21

Views can be dropped using the DROP VIEW command.

How to handle DROP TABLE if theres a view on the table? DROP TABLE command has options to let the user specify this.
32

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

Views and Security

Views can be used to present necessary information (or a summary), while hiding details in underlying relation(s).

Given YoungStudents, but not Students or Enrolled, we can find students s who have are enrolled, but not the cids of the courses they are enrolled in.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

33

Relational Model: Summary

A tabular representation of data. Simple and intuitive, currently the most widely used. Integrity constraints can be specified by the DBA, based on application semantics. DBMS checks for violations.

Two important ICs: primary and foreign keys In addition, we always have domain constraints.

Powerful and natural query languages exist. Rules to translate ER to relational model

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke

34