10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of.

Slides:



Advertisements
Similar presentations
The Relational Model and Relational Algebra Nothing is so practical as a good theory Kurt Lewin, 1945.
Advertisements

Relational Algebra, Join and QBE Yong Choi School of Business CSUB, Bakersfield.
Concepts of Database Management Sixth Edition
Concepts of Database Management Seventh Edition
Database Systems: Design, Implementation, and Management Tenth Edition
Introduction to Structured Query Language (SQL)
SLIDE 1IS 202 – FALL 2005 Prof. Ray Larson UC Berkeley SIMS SIMS 202: Information Organization and Retrieval Normalization & The Relational.
9/30/1999SIMS 257: Database Management -- Ray Larson SQL Commands University of California, Berkeley School of Information Management and Systems SIMS.
Midterm Review Lecture 14b. 14 Lectures So Far 1.Introduction 2.The Relational Model 3.Disks and Files 4.Relational Algebra 5.File Org, Indexes 6.Relational.
SLIDE 1IS 257 – Fall 2006 SQL and Client Applications University of California, Berkeley School of Information IS 257: Database Management.
9/30/1999SIMS 257: Database Management -- Ray Larson Database Client Applications University of California, Berkeley School of Information Management and.
SLIDE 1IS 257 – Fall 2009 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information IS 257:
9/26/2000SIMS 257: Database Management Physical Database Design University of California, Berkeley School of Information Management and Systems SIMS 257:
Fundamentals, Design, and Implementation, 9/e COS 346 Day 11.
SLIDE 1IS 257 – Spring 2004 Physical Database Design and Referential Integrity University of California, Berkeley School of Information Management.
SLIDE 1IS 257 – Spring 2004 SQL and Client Applications University of California, Berkeley School of Information Management and Systems SIMS.
SLIDE 1IS 257 – Fall 2004 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information Management.
Introduction to Structured Query Language (SQL)
SLIDE 1IS 257 – Fall 2008 Physical Database Design and Referential Integrity University of California, Berkeley School of Information IS 257:
SLIDE 1IS 257 – Fall 2006 Physical Database Design and Referential Integrity University of California, Berkeley School of Information IS 257:
10/9/2001SIMS 257: Database Management -- Ray Larson Database Client Applications University of California, Berkeley School of Information Management and.
Fundamentals, Design, and Implementation, 9/e Chapter 6 Introduction to Structured Query Language (SQL)
SLIDE 1IS 257 – Fall 2011 Physical Database Design University of California, Berkeley School of Information I 257: Database Management.
12/5/2000Information Organization and Retrieval Database Design: Normalization and SQL University of California, Berkeley School of Information Management.
SLIDE 1IS Fall 2002 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information Management.
SLIDE 1IS 257 – Fall 2004 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information Management.
9/28/2000SIMS 257: Database Management -- Ray Larson More on Physical Database Design and Referential Integrity University of California, Berkeley School.
SLIDE 1IS 257 – Fall 2009 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information IS 257:
Structured Query Language Chapter Three (Excerpts) DAVID M. KROENKE’S DATABASE CONCEPTS, 2 nd Edition.
Introduction to Structured Query Language (SQL)
Structured Query Language Chapter Three DAVID M. KROENKE’S DATABASE CONCEPTS, 2 nd Edition.
Structured Query Language. Brief History Developed in early 1970 for relational data model: –Structured English Query Language (SEQUEL) –Implemented with.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 7 Introduction to Structured Query Language (SQL)
SLIDE 1IS Fall 2002 Physical Database Design and Referential Integrity University of California, Berkeley School of Information Management.
10/3/2000SIMS 257: Database Management -- Ray Larson Relational Algebra and Calculus University of California, Berkeley School of Information Management.
SLIDE 1IS 257 – Fall 2009 Physical Database Design University of California, Berkeley School of Information I 257: Database Management.
SLIDE 1IS 257 – Fall 2009 SQL and Client Applications University of California, Berkeley School of Information IS 257: Database Management.
DATABASES AND SQL. Introduction Relation: Relation means table(data is arranged in rows and columns) Domain : A domain is a pool of values appearing in.
INFORMATION TECHNOLOGY IN BUSINESS AND SOCIETY SESSION 16 – SQL SEAN J. TAYLOR.
Concepts of Database Management, Fifth Edition
1 Databases & SQL By: Julia Tartakovsky CS 340, Fall 2004 Acknowledgement (for help with the J# code connecting to an Oracle DB): Yosef Lifshits.
SLIDE 1IS 257 – Fall 2013 More on SQL (and SQLite) University of California, Berkeley School of Information I 257: Database Management.
Structured Query Language. Brief History Developed in early 1970 for relational data model: –Structured English Query Language (SEQUEL) –Implemented with.
CHAPTER:14 Simple Queries in SQL Prepared By Prepared By : VINAY ALEXANDER ( विनय अलेक्सजेंड़र ) PGT(CS),KV JHAGRAKHAND.
BACS--485 SQL 11 BACS 485 Structured Query Language.
Concepts of Database Management Seventh Edition
SLIDE 1IS 257 – Fall 2013 Physical Database Design University of California, Berkeley School of Information I 257: Database Management.
SLIDE 1IS 257 – Fall 2012 Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information IS 257:
6 1 Lecture 8: Introduction to Structured Query Language (SQL) J. S. Chou, P.E., Ph.D.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 7 Introduction to Structured.
Chapter 8: SQL. Data Definition Modification of the Database Basic Query Structure Aggregate Functions.
Database Fundamental & Design by A.Surasit Samaisut Copyrights : All Rights Reserved.
AL-MAAREFA COLLEGE FOR SCIENCE AND TECHNOLOGY INFO 232: DATABASE SYSTEMS CHAPTER 7 (Part II) INTRODUCTION TO STRUCTURED QUERY LANGUAGE (SQL) Instructor.
GLOBEX INFOTEK Copyright © 2013 Dr. Emelda Ntinglet-DavisSYSTEMS ANALYSIS AND DESIGN METHODSINTRODUCTORY SESSION EFFECTIVE DATABASE DESIGN for BEGINNERS.
Physical Database Design Purpose- translate the logical description of data into the technical specifications for storing and retrieving data Goal - create.
1 CS 430 Database Theory Winter 2005 Lecture 10: Introduction to SQL.
1 MySQL and SQL. 2 Topics  Introducing Relational Databases  Terminology  Managing Databases MySQL and SQL.
© 2002 by Prentice Hall 1 Structured Query Language David M. Kroenke Database Concepts 1e Chapter 3 3.
Query Processing – Implementing Set Operations and Joins Chap. 19.
SQL: Structured Query Language It enables to create and operate on relational databases, which are sets of related information stored in tables. It is.
1 Section 1 - Introduction to SQL u SQL is an abbreviation for Structured Query Language. u It is generally pronounced “Sequel” u SQL is a unified language.
Concepts of Database Management, Fifth Edition Chapter 3: The Relational Model 2: SQL.
12/4/2001Information Organization and Retrieval Database Design University of California, Berkeley School of Information Management and Systems SIMS 202:
Relational Algebra and Calculus: Introduction to SQL
SQL Query Getting to the data ……..
PL/SQL LANGUAGE MULITPLE CHOICE QUESTION SET-1
Physical Database Design and Referential Integrity
Database systems Lecture 3 – SQL + CRUD
Contents Preface I Introduction Lesson Objectives I-2
Presentation transcript:

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra and Calculus: Introduction to SQL University of California, Berkeley School of Information Management and Systems SIMS 257: Database Management

10/4/2001SIMS 257: Database Management -- Ray Larson Review Physical Database Design RAID Data Integrity

10/4/2001SIMS 257: Database Management -- Ray Larson Physical Design Decisions There are several critical decisions that will affect the integrity and performance of the system. –Storage Format –Physical record composition –Data arrangement –Indexes –Query optimization and performance tuning

10/4/2001SIMS 257: Database Management -- Ray Larson When to Index Tradeoff between time and space: –Indexes permit faster processing for searching –But they take up space for the index –They also slow processing for insertions, deletions, and updates, because both the table and the index must be modified Thus they SHOULD be used for databases where search is the main mode of interaction The might be skipped if high rates of updating and insertions are expected

10/4/2001SIMS 257: Database Management -- Ray Larson When to Use Indexes Rules of thumb –Indexes are most useful on larger tables –Specify a unique index for the primary key of each table –Indexes are most useful for attributes used as search criteria or for joining tables –Indexes are useful if sorting is often done on the attribute –Most useful when there are many different values for an attribute –Some DBMS limit the number of indexes and the size of the index key values –Some indexed will not retrieve NULL values

10/4/2001SIMS 257: Database Management -- Ray Larson RAID Technology Parallel Writes Disk 2Disk 3Disk 4Disk * * Parallel Reads Stripe One logical disk drive

10/4/2001SIMS 257: Database Management -- Ray Larson RAID-5 Parallel Writes Disk 2Disk 3Disk 4Disk ecc ecc * * Parallel Reads Stripe

10/4/2001SIMS 257: Database Management -- Ray Larson Integrity Constraints The constraints we wish to impose in order to protect the database from becoming inconsistent. Five types –Required data –attribute domain constraints –entity integrity –referential integrity –enterprise constraints

10/4/2001SIMS 257: Database Management -- Ray Larson Today Relational Operations Relational Algebra Relational Calculus Introduction to SQL via Access

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra Operations Select Project Product Union Intersect Difference Join Divide

10/4/2001SIMS 257: Database Management -- Ray Larson Select Extracts specified tuples (rows) from a specified relation (table).

10/4/2001SIMS 257: Database Management -- Ray Larson Project Extracts specified attributes(columns) from a specified relation.

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson Union Builds a relation consisting of all tuples appearing in either or both of two specified relations.

10/4/2001SIMS 257: Database Management -- Ray Larson Intersect Builds a relation consisting of all tuples appearing in both of two specified relations

10/4/2001SIMS 257: Database Management -- Ray Larson Difference Builds a relation consisting of all tuples appearing in first relation but not the second.

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson Employee

10/4/2001SIMS 257: Database Management -- Ray Larson Part

10/4/2001SIMS 257: Database Management -- Ray Larson Sales-Rep Hourly

10/4/2001SIMS 257: Database Management -- Ray Larson Customer

10/4/2001SIMS 257: Database Management -- Ray Larson Invoice

10/4/2001SIMS 257: Database Management -- Ray Larson Line-Item

10/4/2001SIMS 257: Database Management -- Ray Larson Join Items

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra What is the name of the customer who ordered Large Red Widgets? –Select “large Red Widgets” 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 Name from temp4

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson SQL Structured Query Language Database Definition and Querying Basic language is standardized across relational DBMSs. Each system may have proprietary extensions to standard. Relational Calculus combines Select, Project and Join operations in a single command. SELECT.

10/4/2001SIMS 257: Database Management -- Ray Larson SQL - History Structured Query Language 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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]

10/4/2001SIMS 257: Database Management -- Ray Larson 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...

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra Selection using SELECT Syntax: –SELECT * WHERE condition1 {AND | OR} condition2;

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra Projection using SELECT Syntax: –SELECT [DISTINCT] attr1, attr2,…, attr3 FROM rel1 r1, rel2 r2,… rel3 r3;

10/4/2001SIMS 257: Database Management -- Ray Larson Relational Algebra Join using SELECT Syntax: –SELECT * FROM rel1 r1, rel2 r2 WHERE r1.linkattr = r2.linkattr ;

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson Aggregate Functions Count Avg SUM MAX MIN Others may be available in different systems

10/4/2001SIMS 257: Database Management -- Ray Larson Using Aggregate functions SELECT attr1, Sum(attr2) AS name FROM tab1, tab2... GROUP BY attr1, attr3 HAVING condition;

10/4/2001SIMS 257: Database Management -- Ray Larson 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"));

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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.

10/4/2001SIMS 257: Database Management -- Ray Larson 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 chars)

10/4/2001SIMS 257: Database Management -- Ray Larson 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 E38 to – E–45 for negative values and from E–45 to E38 for positive values.4 bytes Double –Stores numbers from – E308 to – E–324 for negative values and from E308 to E–324 for positive values.158 bytes Replication ID –Globally unique identifier (GUID)N/A16 bytes

10/4/2001SIMS 257: Database Management -- Ray Larson 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

10/4/2001SIMS 257: Database Management -- Ray Larson 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]

10/4/2001SIMS 257: Database Management -- Ray Larson Alter Table ALTER TABLE table-name ADD COLUMN attr1 attr-type; … DROP COLUMN attr1; Adds a new column to an existing database table.

10/4/2001SIMS 257: Database Management -- Ray Larson 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...

10/4/2001SIMS 257: Database Management -- Ray Larson DELETE DELETE FROM table-name WHERE ; Removes rows from a table.

10/4/2001SIMS 257: Database Management -- Ray Larson UPDATE UPDATE tablename SET attr1=newval, attr2 = newval2 WHERE ; changes values in existing rows in a table (those that match the WHERE clause).

10/4/2001SIMS 257: Database Management -- Ray Larson DROP Table DROP TABLE tablename; Removes a table from the database.

10/4/2001SIMS 257: Database Management -- Ray Larson CREATE INDEX CREATE [ UNIQUE ] INDEX indexname ON tablename (attr1 [ASC|DESC][, attr2 [ASC|DESC],...]) [WITH { PRIMARY | DISALLOW NULL | IGNORE NULL }]