Relational Database. Relational database: a set of relations Relation: made up of 2 parts: − Schema : specifies the name of relations, plus name and type.

Slides:



Advertisements
Similar presentations
Database Management Systems, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
Advertisements

Book Chapter 3 (part 2 ) From ER to Relational Model.
SQL Lecture 10 Inst: Haya Sammaneh. Example Instance of Students Relation  Cardinality = 3, degree = 5, all rows distinct.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke. Edited by Keith Shomper, The Relational Model Chapter 3.
COMP 5138 Relational Database Management Systems Sem2, 2007 Lecture 3 Relational Data Model.
CSC 411/511: DBMS Design 1 1 Dr. Nan WangCSC411_L3_Relational Model 1 The Relational Model (Chapter 3)
The Relational Model CMU SCS /615 C. Faloutsos – A. Pavlo Lecture #3 R & G, Chap. 3.
The Relational Model CMU SCS /615 C. Faloutsos – A. Pavlo Lecture #3 R & G, Chap. 3.
Database Management Systems 1 Raghu Ramakrishnan The Relational Model Chapter 3 Instructor: Mirsad Hadzikadic.
The Relational Model Class 2 Book Chapter 3 Relational Data Model Relational Query Language (DDL + DML) Integrity Constraints (IC) (From ER to Relational)
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 28 Database Systems I The Relational Data Model.
1 Translation of ER-diagram into Relational Schema Prof. Sin-Min Lee Department of Computer Science.
SPRING 2004CENG 3521 The Relational Model Chapter 3.
The Relational Model 198:541 Rutgers University. Why Study the Relational Model?  Most widely used model. Vendors: IBM, Informix, Microsoft, Oracle,
1 Relational Model. 2 Relational Database: Definitions  Relational database: a set of relations  Relation: made up of 2 parts: – Instance : a table,
The Relational Model Lecture 3 Book Chapter 3 Relational Data Model Relational Query Language (DDL + DML) Integrity Constraints (IC) From ER to Relational.
1 Data Modeling Yanlei Diao UMass Amherst Feb 1, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
1 Data Modeling Yanlei Diao UMass Amherst Feb 1, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
ER to Relational Mapping. Logical DB Design: ER to Relational Entity sets to tables. CREATE TABLE Employees (ssn CHAR (11), name CHAR (20), lot INTEGER,
1 The Relational Model Chapter 3. 2 Objectives  Representing data using the relational model.  Expressing integrity constraints on data.  Creating,
The Relational Model These slides are based on the slides of your text book.
The Relational Model Chapter 3
Relational Data Model, R. Ramakrishnan and J. Gehrke with Dr. Eick’s additions 1 The Relational Model Chapter 3.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
The Relational Model. Review Why use a DBMS? OS provides RAM and disk.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model.  Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3 Modified by Donghui Zhang.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model  Vendors: IBM, Informix, Microsoft, Oracle, Sybase  Recent.
 Relational database: a set of relations.  Relation: made up of 2 parts: › Instance : a table, with rows and columns. #rows = cardinality, #fields =
1 Translation of ER-diagram into Relational Schema Prof. Sin-Min Lee Department of Computer Science.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model.  Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model.  Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc.
1 The Relational Model. 2 Why Study the Relational Model? v Most widely used model. – Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc. v “Legacy.
FALL 2004CENG 351 File Structures and Data Management1 Relational Model Chapter 3.
1.1 CAS CS 460/660 Relational Model. 1.2 Review E/R Model: Entities, relationships, attributes Cardinalities: 1:1, 1:n, m:1, m:n Keys: superkeys, candidate.
1 Database Systems ( 資料庫系統 ) October 4, 2005 Lecture #3.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
Database Management Systems, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
The Relational Model Content based on Chapter 3 Database Management Systems, (Third Edition), by Raghu Ramakrishnan and Johannes Gehrke. McGraw Hill, 2003.
CMPT 258 Database Systems The Relationship Model PartII (Chapter 3)
Lecture 3 Book Chapter 3 (part 2 ) From ER to Relational.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Database Management Systems Chapter 3 The Relational Model.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
The Relational Model Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY.
ICS 421 Spring 2010 Relational Model & Normal Forms Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 1/19/20101Lipyeow.
CS34311 The Relational Model. cs34312 Why Relational Model? Currently the most widely used Vendors: Oracle, Microsoft, IBM Older models still used IBM’s.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
Mapping E/R to RM, R. Ramakrishnan and J. Gehrke with Dr. Eick’s additions 1 Mapping E/R Diagrams to Relational Database Schemas Second Half of Chapter.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model.  Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 The Relational Model Chapter 3.
1 CS122A: Introduction to Data Management Lecture #5 (E-R  Relational, Cont.) Instructor: Chen Li.
1 CS122A: Introduction to Data Management Lecture #4 (E-R  Relational Translation) Instructor: Chen Li.
Database Management Systems 1 Raghu Ramakrishnan The Relational Model Chapter 3 Instructor: Xin Zhang.
1 The Relational Model Chapter 3. 2 Why Study the Relational Model?  Most widely used model.  Multi-billion dollar industry, $15+ bill in  Vendors:
CENG 351 File Structures and Data Management1 Relational Model Chapter 3.
COP Introduction to Database Structures
These slides are based on the slides of your text book.
The Relational Model Lecture 3 INFS614, Fall
Translation of ER-diagram into Relational Schema
The Relational Model Chapter 3
The Relational Model Relational Data Model
The Relational Model CMU SCS /615 C. Faloutsos – A. Pavlo
The Relational Model Chapter 3
The Relational Model The slides for this text are organized into chapters. This lecture covers Chapter 3. Chapter 1: Introduction to Database Systems Chapter.
Database Systems (資料庫系統)
The Relational Model Chapter 3
Presentation transcript:

Relational Database

Relational database: a set of relations Relation: made up of 2 parts: − Schema : specifies the name of relations, plus name and type of each column. E.G. Students (sid: string, name: string, login: string, age: integer, gpa: real). −Instance : a table, with rows and columns. #Rows = cardinality, #fields = degree / arity. Can think of a relation as a set of rows or tuples (i.e., all rows are distinct).

Example Instance of Students Relation Cardinality = 3, degree = 5, all rows are distinct.

Integrity Constraints (ICs) IC: condition that must be true for any instance of the database. – ICs are specified when schemas are 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!

Two Common Types of ICs Primary Key Constraints Referential Integrity Constraint

Key: minimal set of the fields of a relation that can uniquely identify a tuple E.g., {SSN} is a key If there’s more than one key for a relation, one of the keys is chosen (by DBA) to be the primary key. The other keys are called candidate keys. Superkey: set of the fields of a relation that can uniquely identify a tuple If {Au, Av,.., Az} is a superkey, then for any two distinct tuples t1 and t2 of a relation R, t1[Au, Av,.., Az] != t2[Au, Av,…, Az] E.g., {SSN, Name, Age} is a superkey. Primary Key

Foreign Key Foreign key (FK) : 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.) FK is Like a `logical pointer’. NAME SSN BDATE ADDRESS SALARY SUPERSSN DNO DNAME DNUMBER MGRSSN MGRSTARTDATE EMPLOYEE DEPARTMENT DNO is a foreign key of EMPLOYEE. Employee: referencing relation Department: referenced relation

Referential Integrity A set of attributes FK in relation schema R1, is a foreign key of R1, if it satisfies the following two rules: Dom(FK) = Dom(PK) where PK is a set of primary key attributes of some relation R 2. Given a tuple t 1 R 1, either t 1 [FK]=null or such that t 1 [FK]=t 2 [PK]

Data Definition Language (DDL) enables creation, deletion, and modification of definitions for tables and views and integrity constraint specification. Data Manipulation Language (DML) allows users to query, to insert, or to delete rows. The SQL Query Language

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

Primary and Candidate Keys in SQL Possibly many candidate keys (specified using UNIQUE ), one of which is chosen as the primary key. v “A student can take a same course only once.” v “Students can take only one course, and no two students in a course receive the same grade.” CREATE TABLE Enrolled (sid CHAR (20), cid CHAR(20), grade CHAR (2), PRIMARY KEY (sid), UNIQUE (cid, grade) ) CREATE TABLE Enrolled (sid CHAR (20), cid CHAR(20), grade CHAR (2), PRIMARY KEY (sid,cid) )

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 Students

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.

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

Destroys the relation Students. The schema information and the tuples are deleted. DROP TABLE Students 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. ALTER TABLE Students ADD firstYear integer Destroying and Altering Relations ALTER TABLE Students drop column firstYear

Insert a single tuple: INSERT INTO Students (sid, name, login, age, gpa) VALUES ('53688', 'Smith', 18, 3.2) Can delete all tuples satisfying some conditions (e.g., name = Smith): DELETE FROM Students S WHERE S.name = 'Smith' Adding and Deleting Tuples

Logical DB Design: ER to Relational Entity sets to tables. CREATE TABLE Employees (ssn CHAR (11), name CHAR (20), lot INTEGER, PRIMARY KEY (ssn)) Employees ssn name lot For each regular entity set E in the ER diagram, create a relation R that includes all the simple attributes of E. Include only the simple component attributes of a composite attribute. Choose one of the key attributes of E as the primary key of R. If the chosen key is composite, the simple attributes that form the key are taken together as the primary key of R.

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 key for the relation. – All descriptive attributes. CREATE TABLE Works_In( ssn CHAR (11), did INTEGER, since DATE, PRIMARY KEY (ssn, did), FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments) dname budgetdid since lot name ssn Works_in Employees Departments

Translating ER Diagrams with Key Constraints Map relationship to a table: – Note that did is the key now! – Separate tables for Employees and Departments. dname budgetdid since lot name ssn Manages Employees 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 ( did INTEGER, dname CHAR(20), budget REAL, mgrssn CHAR(11), since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees) Since each department has a unique manager, we could instead combine Manages and Departments. dname budgetdid since lot name ssn Manages Employees Departments

CREATE TABLE Dept ( did INTEGER, dname CHAR(20), budget REAL, mgrssn CHAR(11), NOT NULL since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees) dname budgetdid since lot name ssn Manages Employees Departments Translating ER Diagrams with Total Participation and Key Constraints

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 ( ssn CHAR(11) NOT NULL, pname CHAR(20), age INTEGER, cost REAL, PRIMARY KEY (pname, ssn), FOREIGN KEY (ssn) REFERENCES Employees ON DELETE CASCADE ) lot name age pname Dependents Employees ssn Policy cost

Translating ISA Hierarchies to Relations General approach: – 3 relations: Employees, Hourly_Emps and Contract_Emps. – Employee(ssn,name,lot); Hourly_Emps (ssn, hourly_wages, hours_worked) Contract_Emps(ssn,contractid) Must delete Hourly_Emps tuple if referenced Employees tuple is deleted). Queries involving all employees are easy. Queries 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) – Contract_Emps (ssn,name,lot,contractid) – Each employee must be in one of these two subclasses.