1. 2004-10-06 SLIDE 1IS 257 – Fall 2004 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information Management and Systems SIMS 257: Database Management

2. 2004-10-06 SLIDE 2IS 257 – Fall 2004 Lecture Outline Review –Design to Relational Implementation Relational Algebra Relational Calculus Introduction to SQL

3. 2004-10-06 SLIDE 3IS 257 – Fall 2004 Lecture Outline Review –Design to Relational Implementation Relational Algebra Relational Calculus Introduction to SQL

4. 2004-10-06 SLIDE 4IS 257 – Fall 2004 Database Design Process Conceptual Model Logical Model External Model Conceptual requirements Conceptual requirements Conceptual requirements Conceptual requirements Application 1 Application 2Application 3Application 4 Application 2 Application 3 Application 4 External Model External Model External Model Internal Model

5. 2004-10-06 SLIDE 5IS 257 – Fall 2004 Cookie ER Diagram AU_ID BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHORS AU_BIB accno AU ID Author Note: diagram contains only attributes used for linking

6. 2004-10-06 SLIDE 6IS 257 – Fall 2004 What Problems? What sorts of problems and missing features arise given the previous ER diagram?

7. 2004-10-06 SLIDE 7IS 257 – Fall 2004 Problems Identified Subtitles, parallel titles? Edition information Series information lending status material type designation Genre, class information Better codes (ISBN?) Missing information (ISBN) Authority control for authors Missing/incomplete data Data entry problems Ordering information Illustrations Subfield separation (such as last_name, first_name) Separate personal and corporate authors

8. 2004-10-06 SLIDE 8IS 257 – Fall 2004 Problems (Cont.) Location field inconsistent No notes field No language field Zipcode doesn’t support plus-4 No publisher shipping addresses No (indexable) keyword search capability No support for multivolume works No support for URLs –to online version –to libraries –to publishers

9. 2004-10-06 SLIDE 9IS 257 – Fall 2004 Original Cookie ER Diagram AU_ID BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHORS AU_BIB accno AU ID Author Note: diagram contains only attributes used for linking

10. 2004-10-06 SLIDE 10IS 257 – Fall 2004 nameid BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHFILE AUTHBIB authtype accno nameid name Cookie2: Separate Name Authorities

11. 2004-10-06 SLIDE 11IS 257 – Fall 2004 Cookie 3: Keywords nameid BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHFILE AUTHBIB authtype accno nameid name KEYMAP TERMS accnotermid

12. 2004-10-06 SLIDE 12IS 257 – Fall 2004 Cookie 4: Series nameid BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHFILE AUTHBIB authtype accno nameid name KEYMAP TERMS accnotermid SERIES seriesid ser_title

13. 2004-10-06 SLIDE 13IS 257 – Fall 2004 Cookie 5: Circulation nameid BIBFILE pubid LIBFILE accno libid CALLFILE pubid PUBFILE libid accno INDXFILE SUBFILE subcodeaccno subcode AUTHFILE AUTHBIB authtype accno nameid name KEYMAP TERMS accnotermid SERIES seriesid ser_title CIRC circidcopynumpatronid PATRON circid

14. 2004-10-06 SLIDE 14IS 257 – Fall 2004 Logical Model: Mapping to Relations Take each entity –BIBFILE –LIBFILE –CALLFILE –SUBFILE –PUBFILE –INDXFILE And make it a table...

15. 2004-10-06 SLIDE 15IS 257 – Fall 2004 Lecture Outline Review –Design to Relational Implementation Relational Algebra Relational Calculus Introduction to SQL

16. 2004-10-06 SLIDE 16IS 257 – Fall 2004 Relational Algebra Relational Algebra is a collection of operators that take relations as their operands and return a relation as their results First defined by Codd –Include 8 operators 4 derived from traditional set operators 4 new relational operations From: C.J. Date, Database Systems 8 th ed.

17. 2004-10-06 SLIDE 17IS 257 – Fall 2004 Relational Algebra Operations Restrict Project Product Union Intersect Difference Join Divide

18. 2004-10-06 SLIDE 18IS 257 – Fall 2004 Restrict Extracts specified tuples (rows) from a specified relation (table) –Restrict is AKA “Select”

19. 2004-10-06 SLIDE 19IS 257 – Fall 2004 Project Extracts specified attributes(columns) from a specified relation.

20. 2004-10-06 SLIDE 20IS 257 – Fall 2004 Product Builds a relation from two specified relations consisting of all possible concatenated pairs of tuples, one from each of the two relations. (AKA Cartesian Product) abcabc xyxy xyxyxyxyxyxy aabbccaabbcc Product

21. 2004-10-06 SLIDE 21IS 257 – Fall 2004 Union Builds a relation consisting of all tuples appearing in either or both of two specified relations.

22. 2004-10-06 SLIDE 22IS 257 – Fall 2004 Intersect Builds a relation consisting of all tuples appearing in both of two specified relations

23. 2004-10-06 SLIDE 23IS 257 – Fall 2004 Difference Builds a relation consisting of all tuples appearing in first relation but not the second.

24. 2004-10-06 SLIDE 24IS 257 – Fall 2004 Join Builds a relation from two specified relations consisting of all possible concatenated pairs, one from each of the two relations, such that in each pair the two tuples satisfy some condition. (E.g., equal values in a given col.) A1 B1 A2 B1 A3 B2 B1 C1 B2 C2 B3 C3 A1 B1 C1 A2 B1 C1 A3 B2 C2 (Natural or Inner) Join

25. 2004-10-06 SLIDE 25IS 257 – Fall 2004 Outer Join Outer Joins are similar to PRODUCT -- but will leave NULLs for any row in the first table with no corresponding rows in the second. A1 B1 A2 B1 A3 B2 A4 B7 B1 C1 B2 C2 B3 C3 A1 B1 C1 A2 B1 C1 A3 B2 C2 A4 * * Outer Join

26. 2004-10-06 SLIDE 26IS 257 – Fall 2004 Divide Takes two relations, one binary and one unary, and builds a relation consisting of all values of one attribute of the binary relation that match (in the other attribute) all values in the unary relation. a xyxy xyzxyxyzxy aaabcaaabc Divide

27. 2004-10-06 SLIDE 27IS 257 – Fall 2004 ER Diagram: Acme Widget Co. Contains Part Part#Count Price Customer Quantity Orders Cust# Invoice Writes Sales-Rep Invoice# Sales Rep# Line-Item Contains Part# Invoice# Cust# Hourly Employee ISA Emp# Wage

28. 2004-10-06 SLIDE 28IS 257 – Fall 2004 Employee

29. 2004-10-06 SLIDE 29IS 257 – Fall 2004 Part

30. 2004-10-06 SLIDE 30IS 257 – Fall 2004 Sales-Rep Hourly

31. 2004-10-06 SLIDE 31IS 257 – Fall 2004 Customer

32. 2004-10-06 SLIDE 32IS 257 – Fall 2004 Invoice

33. 2004-10-06 SLIDE 33IS 257 – Fall 2004 Line-Item

34. 2004-10-06 SLIDE 34IS 257 – Fall 2004 Join Items

35. 2004-10-06 SLIDE 35IS 257 – Fall 2004 Relational Algebra What is the name of the customer who ordered Large Red Widgets? –Restrict “large Red Widgets” row from Part as temp1 –Join temp1 with Line-item on Part # as temp2 –Join temp2 with Invoice on Invoice # as temp3 –Join temp3 with Customer on cust # as temp4 –Project Company from temp4 as answer

36. 2004-10-06 SLIDE 36IS 257 – Fall 2004 Lecture Outline Review –Design to Relational Implementation Relational Operations Relational Algebra Relational Calculus Introduction to SQL

37. 2004-10-06 SLIDE 37IS 257 – Fall 2004 Relational Calculus Relational Algebra provides a set of explicit operations (select, project, join, etc) that can be used to build some desired relation from the database Relational Calculus provides a notation for formulating the definition of that desired relation in terms of the relations in the database without explicitly stating the operations to be performed SQL is based on the relational calculus and algebra

38. 2004-10-06 SLIDE 38IS 257 – Fall 2004 Lecture Outline Review –Design to Relational Implementation Relational Operations Relational Algebra Relational Calculus Introduction to SQL

39. 2004-10-06 SLIDE 39IS 257 – Fall 2004 SQL Structured Query Language Used for both Database Definition, Modification and Querying Basic language is standardized across relational DBMS’s. Each system may have proprietary extensions to standard. Relational Calculus combines Restrict, Project and Join operations in a single command. SELECT.

40. 2004-10-06 SLIDE 40IS 257 – Fall 2004 SQL - History QUEL (Query Language from Ingres) SEQUEL from IBM San Jose ANSI 1992 Standard is the version used by most DBMS today (SQL92) Basic language is standardized across relational DBMSs. Each system may have proprietary extensions to standard.

41. 2004-10-06 SLIDE 41IS 257 – Fall 2004 SQL99 In 1999, SQL99 – also known as SQL3 – was adopted and contains the following eight parts: –The SQL/Framework (75 pages) –SQL/Foundation (1100 pages) –SQL/Call Level Interface (400 pages) –SQL/Persistent Stored Modules (PSM) (160 pages) –SQL/Host Language Bindings (250 pages) –SQL Transactions (??) –SQL Temporal objects (??) –SQL Objects (??) Designed to be compatible with SQL92

42. 2004-10-06 SLIDE 42IS 257 – Fall 2004 SQL99 The SQL/Framework --SQL basic concepts and general requirements. SQL/Call Level Interface (CLI) -- An API for SQL. This is similar to ODBC. SQL/Foundation --The syntax and SQL operations that are the basis for the language.

43. 2004-10-06 SLIDE 43IS 257 – Fall 2004 SQL99 SQL/Persistent Stored Modules (PSM) -- Defines the rules for developing SQL routines, modules, and functions such as those used by stored procedures and triggers. This is implemented in many major RDBMSs through proprietary, nonportable languages, but for the first time we have a standard for writing procedural code that is transportable across databases.

44. 2004-10-06 SLIDE 44IS 257 – Fall 2004 SQL99 SQL/Host Language Bindings --Define ways to code embedded SQL in standard programming languages. This simplifies the approach used by CLIs and provides performance enhancements. SQL Transactions --Transactional support for RDBMSs. SQL Temporal objects --Deal with Time-based data. SQL Objects --The new Object-Relational features, which represent the largest and most important enhancements to this new standard.

45. 2004-10-06 SLIDE 45IS 257 – Fall 2004 SQL99 Data Types SQL Data Types Ref Types Predefined Types Arrays ROW Data Struct User-Defined Types NumericStringDateTimeIntervalBoolean Date Time Timestamp BitCharacterBlob Fixed Varying CLOB Fixed Varying ApproximateExact NEW IN SQL99

46. 2004-10-06 SLIDE 46IS 257 – Fall 2004 SQL Uses Database Definition and Querying –Can be used as an interactive query language –Can be imbedded in programs Relational Calculus combines Select, Project and Join operations in a single command: SELECT

47. 2004-10-06 SLIDE 47IS 257 – Fall 2004 SELECT Syntax: SELECT [DISTINCT] attr1, attr2,…, attr3 FROM rel1 r1, rel2 r2,… rel3 r3 WHERE condition1 {AND | OR} condition2 ORDER BY attr1 [DESC], attr3 [DESC]

48. 2004-10-06 SLIDE 48IS 257 – Fall 2004 SELECT Syntax: SELECT a.author, b.title FROM authors a, bibfile b, au_bib c WHERE a.AU_ID = c.AU_ID and c.accno = b.accno ORDER BY a.author ; Examples in Access...

49. 2004-10-06 SLIDE 49IS 257 – Fall 2004 SELECT Conditions = equal to a particular value >= greater than or equal to a particular value > greater than a particular value <= less than or equal to a particular value <> not equal to a particular value LIKE “*term*” (may be other wild cards in other systems) IN (“opt1”, “opt2”,…,”optn”) BETWEEN val1 AND val2 IS NULL

50. 2004-10-06 SLIDE 50IS 257 – Fall 2004 Relational Algebra Selection using SELECT Syntax: SELECT * WHERE condition1 {AND | OR} condition2;

51. 2004-10-06 SLIDE 51IS 257 – Fall 2004 Relational Algebra Projection using SELECT Syntax: SELECT [DISTINCT] attr1, attr2,…, attr3 FROM rel1 r1, rel2 r2,… rel3 r3;

52. 2004-10-06 SLIDE 52IS 257 – Fall 2004 Relational Algebra Join using SELECT Syntax: SELECT * FROM rel1 r1, rel2 r2 WHERE r1.linkattr = r2.linkattr ;

53. 2004-10-06 SLIDE 53IS 257 – Fall 2004 Sorting SELECT BIOLIFE.[Common Name], BIOLIFE.[Length (cm)] FROM BIOLIFE ORDER BY BIOLIFE.[Length (cm)] DESC; Note: the square brackets are not part of the standard, But are used in Access for names with embedded blanks

54. 2004-10-06 SLIDE 54IS 257 – Fall 2004 Subqueries SELECT SITES.[Site Name], SITES.[Destination no] FROM SITES WHERE sites.[Destination no] IN (SELECT [Destination no] from DEST where [avg temp (f)] >= 78); Can be used as a form of JOIN.

55. 2004-10-06 SLIDE 55IS 257 – Fall 2004 Aggregate Functions Count Avg SUM MAX MIN Others may be available in different systems

56. 2004-10-06 SLIDE 56IS 257 – Fall 2004 Using Aggregate functions SELECT attr1, Sum(attr2) AS name FROM tab1, tab2... GROUP BY attr1, attr3 HAVING condition;

57. 2004-10-06 SLIDE 57IS 257 – Fall 2004 Using an Aggregate Function SELECT DIVECUST.Name, Sum([Price]*[qty]) AS Total FROM (DIVECUST INNER JOIN DIVEORDS ON DIVECUST.[Customer No] = DIVEORDS.[Customer No]) INNER JOIN DIVEITEM ON DIVEORDS.[Order No] = DIVEITEM.[Order No] GROUP BY DIVECUST.Name HAVING (((DIVECUST.Name) Like "*Jazdzewski"));

58. 2004-10-06 SLIDE 58IS 257 – Fall 2004 GROUP BY SELECT DEST.[Destination Name], Count(*) AS Expr1 FROM DEST INNER JOIN DIVEORDS ON DEST.[Destination Name] = DIVEORDS.Destination GROUP BY DEST.[Destination Name] HAVING ((Count(*))>1); Provides a list of Destinations with the number of orders going to that destination

59. 2004-10-06 SLIDE 59IS 257 – Fall 2004 Create Table CREATE TABLE table-name (attr1 attr- type PRIMARYKEY, attr2 attr-type,…,attrN attr-type); Adds a new table with the specified attributes (and types) to the database.

60. 2004-10-06 SLIDE 60IS 257 – Fall 2004 Access Data Types Numeric (1, 2, 4, 8 bytes, fixed or float) Text (255 max) Memo (64000 max) Date/Time (8 bytes) Currency (8 bytes, 15 digits + 4 digits decimal) Autonumber (4 bytes) Yes/No (1 bit) OLE (limited only by disk space) Hyperlinks (up to 64000 chars)

61. 2004-10-06 SLIDE 61IS 257 – Fall 2004 Access Numeric types Byte –Stores numbers from 0 to 255 (no fractions). 1 byte Integer – Stores numbers from –32,768 to 32,767 (no fractions) 2 bytes Long Integer(Default) –Stores numbers from –2,147,483,648 to 2,147,483,647 (no fractions). 4 bytes Single –Stores numbers from -3.402823E38 to –1.401298E–45 for negative values and from 1.401298E–45 to 3.402823E38 for positive values.4 bytes Double –Stores numbers from –1.79769313486231E308 to – 4.94065645841247E–324 for negative values and from 1.79769313486231E308 to 4.94065645841247E–324 for positive values.158 bytes Replication ID –Globally unique identifier (GUID)N/A16 bytes

62. 2004-10-06 SLIDE 62IS 257 – Fall 2004 Oracle Data Types CHAR (size) -- max 2000 VARCHAR2(size) -- up to 4000 DATE DECIMAL, FLOAT, INTEGER, INTEGER(s), SMALLINT, NUMBER, NUMBER(size,d) –All numbers internally in same format… LONG, LONG RAW, LONG VARCHAR –up to 2 Gb -- only one per table BLOB, CLOB, NCLOB -- up to 4 Gb BFILE -- file pointer to binary OS file

63. 2004-10-06 SLIDE 63IS 257 – Fall 2004 Creating a new table from existing tables Syntax: SELECT [DISTINCT] attr1, attr2,…, attr3 INTO newtablename FROM rel1 r1, rel2 r2,… rel3 r3 WHERE condition1 {AND | OR} condition2 ORDER BY attr1 [DESC], attr3 [DESC]

64. 2004-10-06 SLIDE 64IS 257 – Fall 2004 Alter Table ALTER TABLE table-name ADD COLUMN attr1 attr-type; … DROP COLUMN attr1; Adds (drops) a new column to an existing database table.

65. 2004-10-06 SLIDE 65IS 257 – Fall 2004 INSERT INSERT INTO table-name (attr1, attr4, attr5,…, attrK) VALUES (“val1”, val4, val5,…, “valK”); Adds a new row(s) to a table. INSERT INTO table-name (attr1, attr4, attr5,…, attrK) VALUES SELECT...

66. 2004-10-06 SLIDE 66IS 257 – Fall 2004 DELETE DELETE FROM table-name WHERE ; Removes rows from a table.

67. 2004-10-06 SLIDE 67IS 257 – Fall 2004 UPDATE UPDATE tablename SET attr1=newval, attr2 = newval2 WHERE ; changes values in existing rows in a table (those that match the WHERE clause).

68. 2004-10-06 SLIDE 68IS 257 – Fall 2004 DROP Table DROP TABLE tablename; Removes a table from the database.

69. 2004-10-06 SLIDE 69IS 257 – Fall 2004 CREATE INDEX CREATE [ UNIQUE ] INDEX indexname ON tablename (attr1 [ASC|DESC][, attr2 [ASC|DESC],...]) [WITH { PRIMARY | DISALLOW NULL | IGNORE NULL }]