SQL. Lecture 4 SQL. Basic Structure. The select Clause. The select Clause (Cont.) The select Clause (Cont.) Basic Structure.

Similar documents
Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Views Modification of the Database Data Definition

Chapter 4: SQL. Basic Structure

Lecture 3 SQL. Shuigeng Zhou. September 23, 2008 School of Computer Science Fudan University

DATABASE TECHNOLOGY - 1MB025

DATABASE TECHNOLOGY - 1MB025

DATABASTEKNIK - 1DL116

Chapter 3: SQL. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan See for conditions on re-use

Chapter 3: SQL. Chapter 3: SQL

Silberschatz, Korth and Sudarshan See for conditions on re-use

Database System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "

Upon completion of this Unit, students will be introduced to the following

DATABASE DESIGN I - 1DL300

Database Systems SQL SL03

The SQL database language Parts of the SQL language

DATABASE TECHNOLOGY. Spring An introduction to database systems

Database Systems SQL SL03

QQ Group

Chapter 3: Introduction to SQL

The SQL data-definition language (DDL) allows defining :

Chapter 3: Introduction to SQL. Chapter 3: Introduction to SQL

Chapter 3: Introduction to SQL

Simple SQL Queries (2)

Relational Algebra. Relational Algebra. 7/4/2017 Md. Golam Moazzam, Dept. of CSE, JU

Chapter 3: Relational Model

Chapter 4: SQL Database System Concepts 4.1 Silberschatz, Korth and Sudarshan

CS34800 Information Systems. The Relational Model Prof. Walid Aref 29 August, 2016

CS 582 Database Management Systems II

Domain Constraints Referential Integrity Assertions Triggers. Authorization Authorization in SQL

More on SQL. Juliana Freire. Some slides adapted from J. Ullman, L. Delcambre, R. Ramakrishnan, G. Lindstrom and Silberschatz, Korth and Sudarshan

Chapter 6: Formal Relational Query Languages

WHAT IS SQL. Database query language, which can also: Define structure of data Modify data Specify security constraints

Chapter 2: Relational Model

Explain in words what this relational algebra expression returns:

UNIT- II (Relational Data Model & Introduction to SQL)

SQL (Structured Query Language)

CS425 Fall 2017 Boris Glavic Chapter 4: Introduction to SQL

DATABASDESIGN FÖR INGENJÖRER - 1DL124

Chapter 5: Other Relational Languages

Chapter 5: Other Relational Languages.! Query-by-Example (QBE)! Datalog

SQL OVERVIEW. CS121: Relational Databases Fall 2017 Lecture 4

DATABASE DESIGN - 1DL400

SQL QUERIES. CS121: Relational Databases Fall 2017 Lecture 5

SQL - Basics. SQL Overview

Database System Concepts

Textbook: Chapter 6! CS425 Fall 2013 Boris Glavic! Chapter 3: Formal Relational Query. Relational Algebra! Select Operation Example! Select Operation!

Chapter 4. Basic SQL. Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

DATABASE DESIGN - 1DL400

Midterm Review. Winter Lecture 13

CSCC43H: Introduction to Databases. Lecture 4

Lecture 6 - More SQL

DATABASE TECHNOLOGY - 1MB025 (also 1DL029, 1DL300+1DL400)

Database System Concepts

CSIT5300: Advanced Database Systems

Relational Algebra. Procedural language Six basic operators

Principles of Data Management

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Unit 2: SQL AND PL/SQL

Database System Concepts

Chapter 14 Query Optimization

Chapter 14 Query Optimization

Chapter 14 Query Optimization

Chapter 14: Query Optimization

Integrity and Security

Relational Model, Relational Algebra, and SQL

Contents Contents Introduction Basic Steps in Query Processing Introduction Transformation of Relational Expressions...

UNIT III INTRODUCTION TO STRUCTURED QUERY LANGUAGE (SQL)

Chapter 12: Query Processing

CMSC 424 Database design Lecture 18 Query optimization. Mihai Pop

CS121 MIDTERM REVIEW. CS121: Relational Databases Fall 2017 Lecture 13

SQL Data Querying and Views

Chapter 4. Basic SQL. SQL Data Definition and Data Types. Basic SQL. SQL language SQL. Terminology: CREATE statement

Database Systems: Design, Implementation, and Management Tenth Edition. Chapter 7 Introduction to Structured Query Language (SQL)

Relational Database: The Relational Data Model; Operations on Database Relations

Other Relational Query Languages

SQL functions fit into two broad categories: Data definition language Data manipulation language

Outline. Textbook Chapter 6. Note 1. CSIE30600/CSIEB0290 Database Systems Basic SQL 2

CSIE30600 Database Systems Basic SQL 2. Outline

Simple queries Set operations Aggregate operators Null values Joins Query Optimization. John Edgar 2

Slides by: Ms. Shree Jaswal

SQL: Data Querying. B0B36DBS, BD6B36DBS: Database Systems. h p:// Lecture 4

II. Structured Query Language (SQL)

Basic SQL. Dr Fawaz Alarfaj. ACKNOWLEDGEMENT Slides are adopted from: Elmasri & Navathe, Fundamentals of Database Systems MySQL Documentation

DATABASE MANAGEMENT SYSTEMS UNIT II- RELATIONAL MODEL

Relational Databases

Set theory is a branch of mathematics that studies sets. Sets are a collection of objects.

II. Structured Query Language (SQL)

CMP-3440 Database Systems

Database System Concepts, 5 th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "

CSEN 501 CSEN501 - Databases I

CSC Web Programming. Introduction to SQL

Database System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "

Relational Algebra and SQL

Chapter A: Network Model

Basic Concepts. Chapter A: Network Model. Cont.) Data-Structure Diagrams (Cont( Data-Structure Diagrams. Basic Concepts

Outline. Note 1. CSIE30600 Database Systems More SQL 2

COGS 121 HCI Programming Studio. Week 03 - Tech Lecture

Information Systems Engineering. SQL Structured Query Language DML Data Manipulation (sub)language

Relational Model. Prepared by: Ms. Pankti Dharwa ( Asst. Prof, SVBIT)

Announcements (September 14) SQL: Part I SQL. Creating and dropping tables. Basic queries: SFW statement. Example: reading a table

Mahathma Gandhi University

Transcription:

SL Lecture 4 SL Chapter 4 (Sections 4.1, 4.2, 4.3, 4.4, 4.5, 4., 4.8, 4.9, 4.11) Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Modification of the Database Joined Relations Data Definition Language 2 Basic Structure The select Clause SL is based on set and relational operations with certain modifications and enhancements A typical SL query has the form: select A 1, A 2,..., A n from r 1, r 2,..., r m where P + A i s represent attributes + r i s represent relations + P is a predicate. This query is equivalent to the relational algebra expression. A1, A2,..., An (σ P (r 1 x r 2 x... x r m )) The result of an SL query is a relation. The select clause corresponds to the projection operation of the relational algebra. It is used to list the attributes desired in the result of a query. Find the names of all branches in the loan relation select branch-name In the pure relational algebra syntax, the query would be: branch-name (loan) An asterisk in the select clause denotes all attributes NOTES: select * + SL does not permit the - character in names, so you would use, for example, branch_name instead of branch-name in a real implementation. We use - since it looks nicer! + SL names are case insensitive. 3 4 The select Clause (Cont.) The select Clause (Cont.) SL allows duplicates in relations as well as in query results. To force the elimination of duplicates, insert the keyword distinct after select. Find the names of all branches in the loan relations, and remove duplicates select distinct branch-name The keyword all specifies that duplicates should not be removed. select all branch-name The select clause can contain arithmetic expressions involving the operation, +,,, and /, and operating on constants or attributes of tuples. The query: select loan-number, branch-name, amount 1 returns a relation which is the same as the loan relations, except that the attribute amount is multiplied by 1. 5 1

The where Clause The where Clause (Cont.) The where clause corresponds to the selection predicate of the relational algebra. If consists of a predicate involving attributes of the relations that appear in the from clause. SL includes a between comparison operator in order to simplify where clauses that specify that a value be less than or equal to some value and greater than or equal to some other value. Find all loan number for loans made a the Perryridge branch with loan amounts greater than $12. select loan-number where branch-name = Perryridge and amount > 12 Find the loan number of those loans with loan amounts between $9, and $1, (that is, $9, and $1,) select loan-number where amount between 9 and 1 SL allows use of the logical connectives and, or, and not. It allows the use of arithmetic expressions as operands to the comparison operators. 7 8 The from Clause The Rename Operation The from clause corresponds to the Cartesian product operation of the relational algebra. It lists the relations to be scanned in the evaluation of the expression. The SL allows renaming relations and attributes using the as clause: old-name as new-name Find the Cartesian product borrower x loan select Find the name and loan number of all customers having a loan at the Perryridge branch select distinct customer-name, borrower.loan-number where borrower.loan-number = loan.loan-number and branch-name = Perryridge Find the name and loan number of all customers; replace the column name loan-number with the name loan-id. select distinct customer-name, borrower.loan-number as loan-id where borrower.loan-number = loan.loan-number 9 1 Tuple Variables String Operations Tuple variables are defined in the from clause via the use of the as clause. Find the customer names and their loan numbers for all customers having a loan at some branch. select distinct customer-name, T.loan-number from borrower as T, loan as S where T.loan-number = S.loan-number SL includes a string-matching operator for comparisons on character strings. Patterns are described using two special characters: + percent (%). The % character matches any substring. + underscore (_). The _ character matches any character. Find the names of all customers whose street includes the substring Main. select customer-name from customer where customer-street like %Main% Find the names of all branches that have greater assets than some branch located in Brooklyn. select distinct T.branch-name as T, branch as S where T.assets > S.assets and S.branch-city = Brooklyn Match the name Main% like Main\% escape \ 11 12 2

Ordering the Display of Tuples Duplicates List in alphabetic order the names of all customers having a loan in Perryridge branch select distinct customer-name where borrower loan-number = loan.loan-number and branch-name = Perryridge order by customer-name We may specify desc for descending order or asc for ascending order, for each attribute; ascending order is the default. + E.g. order by customer-name desc In relations with duplicates, SL can define how many copies of tuples appear in the result. Multiset versions of some of the relational algebra operators given multiset relations r 1 and r 2 : 1. If there are c 1 copies of tuple t 1 in r 1, and t 1 satisfies selections σ θ,, then there are c 1 copies of t 1 in σ θ (r 1 ) 2. For each copy of tuple t 1 in r 1, there is a copy of tuple Π A (t 1 ) in Π A (r 1 ) where Π A (t 1 ) denotes the projection of the single tuple t 1. 3. If there are c 1 copies of tuple t 1 in r 1 and c 2 copies of tuple t 2 in r 2, there are c 1 x c 2 copies of the tuple t 1. t 2 in r 1 x r 2 13 14 Duplicates (Cont.) Set Operations Suppose multiset relations r 1 (A, B) and r 2 (C) are as follows: r 1 = {(1, a), (2,a)} r 2 = {(2), (3), (3)} The set operations union, intersect, and except operate on relations and correspond to the relational algebra operations,,. Then Π B (r 1 ) would be {(a), (a)}, while Π B (r 1 ) x r 2 would be {(a,2), (a,2), (a,3), (a,3), (a,3), (a,3)} SL duplicate semantics: select A 1,, A 2,..., A n from r 1, r 2,..., r m where P is equivalent to the multiset version of the expression: Π A1,, A2,..., An (σ P (r 1 x r 2 x... x r m )) Each of the above operations automatically eliminates duplicates; to retain all duplicates use the corresponding multiset versions union all, intersect all, and except all. Suppose a tuple occurs m times in r and n times in s, then, it occurs: + m + n times in r union all s + min(m,n) times in r intersect all s + max(, m n) times in r except all s 15 1 Set Operations Aggregate Functions Find all customers who have a loan, an account, or both: (select customer-name from depositor) union (select customer-name from borrower) Find all customers who have both a loan and an account. (select customer-name from depositor) intersect (select customer-name from borrower) These functions operate on the multiset of values of a column of a relation, and return a value avg: average value min: minimum value max: maximum value sum: sum of values count: number of values Find all customers who have an account but no loan. (select customer-name from depositor) except (select customer-name from borrower) 17 18 3

Aggregate Functions (Cont.) Aggregate Functions Group By Find the average account balance at the Perryridge branch. select avg (balance) from account where branch-name = Perryridge Find the number of tuples in the customer relation. select count (*) from customer Find the number of depositors in the bank. select count (distinct customer-name) from depositor Find the number of depositors for each branch. select branch-name, count (distinct customer-name) from depositor, account where depositor.account-number = account.account-number group by branch-name Note: Attributes in select clause outside of aggregate functions must appear in group by list 19 2 Aggregate Functions Having Clause Null Values Find the names of all branches where the average account balance is more than $1,2. select branch-name, avg (balance) from account group by branch-name having avg (balance) > 12 Note: Predicates in the having clause are applied after the formation of groups whereas predicates in the where clause are applied before forming groups It is possible for tuples to have a null value, denoted by null, for some of their attributes null signifies an unknown value or that a value does not exist. The predicate is null can be used to check for null values. + E.g. Find all loan number which appear in the loan relation with null values for amount. select loan-number where amount is null The result of any arithmetic expression involving null is null + E.g. 5 + null returns null 21 22 Null Values and Three Valued Logic Null Values and Aggregates Any comparison with null returns unknown + E.g. 5 < null or null <> null or null = null Three-valued logic using the truth value unknown: + OR: (unknown or true) = true, (unknown or false) = unknown, (unknown or unknown) = unknown + AND: (true and unknown) = unknown, (false and unknown) = false, (unknown and unknown) = unknown + NOT: (not unknown) = unknown + P is unknown evaluates to true if predicate P evaluates to unknown Total all loan amounts select sum (amount) + Above statement ignores null amounts; + result is null if there is no non-null amount. All aggregate operations except count(*) ignore tuples with null values on the aggregated attributes. Result of where clause predicate is treated as false if it evaluates to unknown. 23 24 4

Nested Subqueries Example uery SL provides a mechanism for the nesting of subqueries. A subquery is a select-from-where expression that is nested within another query. A common use of subqueries is to perform tests for set membership, set comparisons, and set cardinality. Find all customers who have both an account and a loan at the bank. select distinct customer-name from borrower where customer-name in (select customer-name from depositor) Find all customers who have a loan at the bank but do not have an account at the bank. select distinct customer-name from borrower where customer-name not in (select customer-name from depositor) 25 2 Example uery Set Comparison Find all customers who have both an account and a loan at the Perryridge branch. select distinct customer-name where borrower.loan-number = loan.loan-number and branch-name = Perryridge and (branch-name, customer-name) in (select branch-name, customer-name from depositor, account where depositor.account-number = account.account-number) Find all branches that have greater assets than some branch located in Brooklyn. select distinct T.branch-name as T, branch as S where T.assets > S.assets and S.branch-city = Brooklyn Same query using > some clause select branch-name where assets > some (select assets where branch-city = Brooklyn ) 27 28 Definition of Some Clause Definition of all Clause F <comp> some r t r s.t. (F <comp> t) Where <comp> can be: <,, >, =, (5< some 5 ) = true (read: 5 < some tuple in the relation) (5< some (5 = some 5 ) = false 5 ) = true (5 some 5 ) = true (since 5) (= some) in However, ( some) not in F <comp> all r t r (F <comp> t) (5< all 5 ) = false (5< all 1 4 (5 = all 5 ) = true ) = false 4 (5 all ) = true (since 5 4 and 5 ) ( all) not in However, (= all) in 29 3 5

Example uery Test for Empty Relations Find the names of all branches that have greater assets than all branches located in Brooklyn. The exists construct returns the value true if the argument subquery is nonempty. select branch-name where assets > all ( select assets where branch-city = Brooklyn ) exists r r Ø not exists r r = Ø 31 32 Example uery Test for Absence of Duplicate Tuples Find all customers who have an account at all branches located in Brooklyn. select distinct S.customer-name from depositor as S where not exists ( (select branch-name where branch-city = Brooklyn ) except (select R.branch-name from depositor as T, account as R where T.account-number = R.account-number and S.customer-name = T.customer-name)) Note that X Y = Ø X Y Note: Cannot write this query using = all and its variants The unique construct tests whether a subquery has any duplicate tuples in its result. Find all customers who have at most one account at the Perryridge branch. select T.customer-name from depositor as T where unique ( select R.customer-name from account, depositor as R where T.customer-name = R.customer-name and R.account-number = account.account-number and account.branch-name = Perryridge ) 33 34 Example uery Derived Relations Find all customers who have at least two accounts at the Perryridge branch. select distinct T.customer-name from depositor T where not unique ( select R.customer-name from account, depositor as R where T.customer-name = R.customer-name and R.account-number = account.account-number and account.branch-name = Perryridge ) Find the average account balance of those branches where the average account balance is greater than $12. select branch-name, avg-balance from (select branch-name, avg (balance) from account group by branch-name) as result (branch-name, avg-balance) where avg-balance > 12 Note that we do not need to use the having clause, since we compute the temporary relation result in the from clause, and the attributes of result can be used directly in the where clause. 35 3

Modification of the Database Deletion Example uery Delete all account records at the Perryridge branch delete from account where branch-name = Perryridge Delete the record of all accounts with balances below the average at the bank. Delete all accounts at every branch located in Needham city. delete from account where branch-name in (select branch-name where branch-city = Needham ) delete from depositor where account-number in (select account-number, account where branch-city = Needham and branch.branch-name = account.branch-name) delete from account where balance < (select avg (balance) from account) Problem: as we delete tuples from deposit, the average balance changes Solution used in SL: 1. First, compute avg balance and find all tuples to delete 2. Next, delete all tuples found above (without recomputing avg or retesting the tuples) 37 38 Modification of the Database Insertion Modification of the Database Insertion Add a new tuple to account insert into account values ( A-9732, Perryridge,12) or equivalently insert into account (branch-name, balance, account-number) values ( Perryridge, 12, A-9732 ) Add a new tuple to account with balance set to null insert into account values ( A-777, Perryridge, null) Provide as a gift for all loan customers of the Perryridge branch, a $2 savings account. Let the loan number serve as the account number for the new savings account insert into account select loan-number, branch-name, 2 where branch-name = Perryridge insert into depositor select customer-name, loan-number, borrower where branch-name = Perryridge and loan.account-number = borrower.account-number The select-from-where statement is fully evaluated before any of its results are inserted into the relation (otherwise queries like insert into table1 select * from table1 would cause problems 39 4 Modification of the Database Updates Data Definition Language (DDL) Increase all accounts with balances over $1, by %, all other accounts receive 5%. + Write two update statements: + The order is important! update account set balance = balance 1. where balance > 1 update account set balance = balance 1.5 where balance 1 Allows the specification of not only a set of relations but also information about each relation, including: The schema for each relation. The domain of values associated with each attribute. Integrity constraints The set of indices to be maintained for each relations. Security and authorization information for each relation. The physical storage structure of each relation on disk. 41 42 7

Domain Types in SL Create Table Construct char(n). Fixed length character string, with user-specified length n. varchar(n). Variable length character strings, with user-specified maximum length n. int. Integer (a finite subset of the integers that is machine-dependent). smallint. Small integer (a machine-dependent subset of the integer domain type). numeric(p,d). Fixed point number, with user-specified precision of p digits, with n digits to the right of decimal point. real, double precision. Floating point and double-precision floating point numbers, with machine-dependent precision. float(n). Floating point number, with user-specified precision of at least n digits. An SL relation is defined using the create table command: create table r (A 1 D 1, A 2 D 2,..., A n D n, (integrity-constraint 1 ),..., (integrity-constraint k )) + r is the name of the relation + each A i is an attribute name in the schema of relation r + D i is the data type of values in the domain of attribute A i Example: create table branch (branch-name char(15) not null, branch-city char(3), assets integer) 43 44 Integrity Constraints in Create Table Drop and Alter Table Constructs not null primary key (A 1,..., A n ) check (P), where P is a predicate Example: Declare branch-name as the primary key for branch and ensure that the values of assets are non-negative. create table branch (branch-name char(15), branch-city char(3) assets integer, primary key (branch-name), check (assets >= )) primary key declaration on an attribute automatically ensures not null in SL-92 onwards The drop table command deletes all information about the dropped relation from the database. The after table command is used to add attributes to an existing relation. All tuples in the relation are assigned null as the value for the new attribute. The form of the alter table command is alter table r add A D where A is the name of the attribute to be added to relation r and D is the domain of A. The alter table command can also be used to drop attributes of a relation alter table r drop A where A is the name of an attribute of relation r + Dropping of attributes not supported by many database systems. 45 4 SL Data Definition for Part of the Bank Database 47 8