1. 1 The Relational Model Chapter 3

2. 2 Why Study the Relational Model?  Most widely used model.  Multi-billion dollar industry, $15+ bill in 2006.  Vendors: IBM, Microsoft, Oracle, SAP, Peoplesoft, Informix, Sybase.  Recent competitor: object-oriented model  ObjectStore, Versant, Ontos  A synthesis emerging: object-relational model Informix Universal Server, UniSQL, O2, Oracle, DB2

3. 3 Overview  The Relational Model  Creating Relations in SQL

4. 4 The Relational Model

5. 5 Relational Database: Definitions  Relational database: a set of relations  Relation = Instance + Schema  Instance : a table, with rows and columns. #Rows = cardinality, #fields = degree or 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 (all rows are distinct).

6. 6 Example Instance of Students Relation  Cardinality = 3, degree = 5, all rows distinct  Do all columns in a relation instance have to be distinct?

7. 7 Quick Question How many distinct tuples are in a relation instance with cardinality 22?

8. 8 Relational Query Languages  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.

9. 9 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) ...SQL-2011

10. 10 The SQL Query Language: Preview  To find all 18 year old students, we can write: SELECT * FROM Students S WHERE S.age=18 To find just names and logins, replace the first line: SELECT S.name, S.login

11. 11 Exercise 1. Modify this query so that only the login column is included in the answer. 2. If the clause WHERE S.gpa >= 3.3 is added to the original query, what is the set of tuples in the answer? 3. What if the clause WHERE S.gpa > Jones is added? SELECT * FROM Students S WHERE S.age=18

12. 12 Querying Multiple Relations  What does the following query compute? SELECT S.name, E.cid FROM Students S, Enrolled E WHERE S.sid=E.sid AND E.grade=“A” Given the following instance of Enrolled: we get:

13. 13 Data Description: Creating Tables in SQL

14. 14 Creating Relations in SQL  Creates the Students relation.  The type (domain) of each field is specified.  Enforced by the DBMS. CREATE TABLE Students (sid CHAR(20), name CHAR(20), login CHAR(10), age INTEGER, gpa REAL ) CREATE TABLE Enrolled (sid CHAR(20), cid CHAR(20), grade CHAR (2)) The Enrolled table holds information about courses that students take.

15. 15 Destroying and Altering Relations  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. ALTER TABLE Students ADD COLUMN firstYear integer

16. 16 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 S.name = ‘Smith’

17. 17 Data Description Specifying Constraints in SQL

18. 18 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.  ICs make stored data more faithful to real- world meaning.  Avoids data entry errors.

19. 19 Candidate Keys  A set of fields is a superkey for a relation if : No two distinct tuples can have same values in all key fields.  Candidate key = minimal superkey = no subset of fields is a superkey.  Examples.  sid is a candidate key for Students. (What about name ?)  The set { sid, gpa } is a superkey but not a candidate key.

20. 20 Primary Keys in SQL  Possibly many candidate keys (specified using UNIQUE ), one of which is chosen as the primary key. CREATE TABLE Enrolled (sid CHAR (20), cid CHAR(20), grade CHAR (2), PRIMARY KEY (sid,cid) )  “For a given student and course, there is a single grade.” vs. “Students can take only one course, and receive a single grade for that course; further, no two students in a course receive the same grade.”  What does the Unique constraint do? Is this a good idea? CREATE TABLE Enrolled (sid CHAR (20) cid CHAR(20), grade CHAR (2), PRIMARY KEY (sid), UNIQUE (cid, grade) )

21. 21 Exercise 1.Give an example of an attribute (or set of attributes) that you can deduce is not a candidate key, if this instance is legal. 2.Is there any example of an attribute (or set of attributes) that you can deduce is a candidate key? 3.Does every relational schema have some candidate key?

22. 22 Foreign Keys

23. 23 Multiple Choice Question on Foreign Keys Suppose we try to delete a record that has a foreign key constraint defined on it. (There is another record pointing to it.) The effect of the foreign key constraint is to a.reject the deletion. b.propagate/cascade the deletion to linked records. c.use a NULL value d.take action as specified by the database designer.

24. 24 Foreign Keys and 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 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.

25. 25 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

26. 26 Enforcing Referential Integrity  sid in Enrolled is a foreign key that references Students. 1. What should be done if an Enrolled tuple with a non-existent student id is inserted? 2. What should be done if a Students tuple is deleted, e.g. sid = 53666?  Delete all Enrolled tuples that refer to 53666.  Disallow deletion 53666.  Set sid in Enrolled tuples that refer to 53666 to a default sid.  Set sid in Enrolled tuples that refer to it to a special value null, denoting `unknown’ or `inapplicable’.

27. 27 Referential Integrity in SQL  SQL/92 and SQL:1999 support all 4 options on deletes and updates.  Default is NO ACTION ( delete/update is rejected )  CASCADE (also delete all tuples that refer to 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 ON UPDATE SET DEFAULT )

28. 28 Primary and Foreign Keys  A foreign key must point to a primary key.  In logic, we can introduce names to denote entities.  In object-oriented models, we can have object IDs.  In the relational model, primary keys play the role of names of entities.  Base tables define names for entities.  E.g. student ids in Students.  Foreign keys point to names defined by other tables.

29. 29 Where do ICs Come From?  ICs are based upon the semantics of the real- world 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!  For 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.

30. 30 Translate ER Diagrams to SQL

31. 31 Problem Solving Steps  Understand the business rules/requirements  Draw the ER diagram  Write the SQL and create the database

32. 32 Basic Translation Method  Introduce one table for each entity set.  key attribute -> primary key.  Introduce one table for each relationship.  if no key constraints: key attributes of related entity sets -> primary key (multi- column).  if key constraints: key attribute of entity set with key constraint -> primary key (single- column).

33. 33 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 ssn namelot 1000Atishoo1 2000Maite2.... 1000Cecile1

34. 34 Review: The Works_In Relation lo t nam e dname budgetdi d sinc e nam e dname budgetdi d sinc e Manages sinc e Department s Employees ssn Works_In Exercise: 1.Write a create statement for the Departments entity set. 2.Write a create statement for the Works_In relation. Don’t worry too much about the exact syntax. It’s enough for now just to have an approach. E.g, how many columns do you need? What kind of columns?

35. 35 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 (11), did INTEGER, since DATE, PRIMARY KEY (ssn, did), FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments)

36. 36 Example Instance 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) ssndidsince AttishooPharmacy2000 CecileReception2010.... CecileReception2011

37. 37 KEY CONSTRAINTS Translating ER Diagram Constraints

38. 38 Key Constraints  Each dept has at most one manager, according to the key constraint on Manages. Translation to relational model? Many-to-Many1-to-11-to ManyMany-to-1 dname budget did since lot name ssn Manages Employees Departments

39. 39 Translating ER Diagrams: Option 1  Map relationship to a table with just one primary key field. CREATE TABLE Manages( ssn CHAR(11), did INTEGER, since DATE, PRIMARY KEY (did), /*not (did,ssn) FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments) didssnsince 10010002000 20020002001 10030002005 did dnamebudget 100CS1M 200Biology10M 300Engineering100M Departments Manages

40. 40 Translating ER Diagram: Option 2  Sometimes a good idea to combine Manages and 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) did dnamebudgetssnsince 100CS1M 10002000 200Biology10M 20002001 300Engineering100M10002006 400Philosophy10Mnull1999 Dept_Mgr

41. 41 PARTICIPATION CONSTRAINTS Translating ER Diagram Constraints

42. 42 Participation Constraints  Every department must have some employee.  Each employee must work in some department.  Can we capture these constraints? 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) lo t nam e dname budgetdi d nam e dname budgetdi d sinc e Department s Employees ssn Works_In

43. 43 Participation Constraint + Key Constraint lot name dname budgetdid since name dname budgetdid since Manages Departments Employees ssn  We can capture participation + key constraints involving one entity set in a binary relationship.  But little else (with what we have so far). 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 )

44. 44 Example Instance 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) did dnamebudgetssnsince 100CS1M 10002000 200Biology10M 20002001 300Engineering100M10002006 400Philosophy10Mnull1999 Dept_Mgr

45. 45 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 relationship with key + participation constraint  Weak entity set must have total participation in this identifying relationship set. login filename Assignment Students sid Submits gradesubmit time

46. 46 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.  What guarantees existence of owner? CREATE TABLE Assignments ( filename CHAR(20), sid CHAR(20), submittime time, grade CHAR(2), PRIMARY KEY (filename, sid), FOREIGN KEY (sid) REFERENCES Students(sid) ON DELETE CASCADE )

47. 47 Example Instance FilenameStudentIDgradesubmittime assign1.pdf1000A23:00 assign1.pdf2000A+10:00.... assign1.pdf1000C9:00

48. 48 Review: Binary vs. Ternary Relationships Beneficiary age pname Dependents policyid cost Policies Purchaser name Employees ssn lot Better design

49. 49 Binary vs. Ternary Relationships SQL  The key constraints allow us to combine Purchaser with Policies and Beneficiary with Dependents.  Participation constraints lead to NOT NULL constraints. CREATE TABLE Policies ( policyid INTEGER, cost REAL, ssn CHAR(11) NOT NULL, PRIMARY KEY (policyid). FOREIGN KEY (ssn) REFERENCES Employees, ON DELETE CASCADE ) CREATE TABLE Dependents ( pname CHAR(20), age INTEGER, policyid INTEGER, PRIMARY KEY (pname, policyid). FOREIGN KEY (policyid) REFERENCES Policies, ON DELETE CASCADE )

50. 50 Review: ISA Hierarchies Contract_Emps name ssn Employees lot hourly_wages ISA Hourly_Emps contractid hours_worked  As in C++, or Java, attributes are inherited.  If we declare A ISA B, every A entity is also considered to be a B entity.  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)

51. 51 Translating ISA Hierarchies to Relations  3 relations: Employees, Hourly_Emps and Contract_Emps.  Every employee is recorded in Employees. For hourly emps, extra info recorded in Hourly_Emps ( hourly_wages, hours_worked, ssn)  2 relations: 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.  1 relation: Employees.  Emps : ssn, name, lot, hourly_wages, hours_worked, contractid.  Requires null values.

52. 52 Example Instances: 3 relations ssn namelot 1000Atishoo1 2000Maite2.... Employees ssn hourly_wageshours_worked 1000$20100 2000$5020.... Hourly Employees ssn ContractID 20002215A.... Contract Employees

53. 53 Example Instances: 2 relations ssn namelothourly_wageshours_worked 1000Atishoo1$20100 2000Maite2$5020.... Hourly Employees ssn ContractIDnamelot 20002215AMaite2.... Contract Employees  assumes covering

54. 54 Example Instances: 1 relations ssn namelothourly_wageshours_ worked contractID 1000Atishoo1$20100null 2000Maite2$50202215A.... Employees

55. 55 Summary: From ER to SQL  Basic construction: each entity set becomes a table.  Each relationship becomes a table with primary keys that are also foreign keys referencing the entities involved.  Key constraints in ER give option of merging entity table with relationship table (e.g. Dept_Mgr).  Use non-null to enforce participation.

56. 56 Views

57. 57 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 S.name, E.grade FROM Students S, Enrolled E WHERE S.sid = E.sid and S.age<21  Views can be dropped using the DROP VIEW command.

58. 58 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 cid’s of the courses they are enrolled in.

59. 59 View Exercise Consider the following schema. Emp(eid: integer, ename: string, age: integer, salary: real) Works(eid: integer, did: integer, pct_time: integer) Dept(did: integer, budget: real, managerid: integer) And the view CREATE VIEW SeniorEmp(sname, sage, salary) AS SELECT E.ename, E.age, E.salary FROM Emp E WHERE E.age >50

60. 60 Exercise ctd. How will the system process the query: SELECT S.sname FROM SeniorEmp S WHERE S.salary > 100,000

61. 61 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.  Rules to translate ER to relational model  Powerful and natural query languages exist.