06a: SQL-1 The Basics– Select-From-Where

Slides:



Advertisements
Similar presentations
CS411 Database Systems Kazuhiro Minami 06: SQL. SQL = Structured Query Language Standard language for querying and manipulating data Has similar capabilities.
Advertisements

Union, Intersection, Difference (subquery) UNION (subquery) produces the union of the two relations. Similarly for INTERSECT, EXCEPT = intersection and.
SQL Introduction Standard language for querying and manipulating data Structured Query Language Many standards out there: SQL92, SQL2, SQL3. Vendors support.
SQL Group Members: Shijun Shen Xia Tang Sixin Qiang.
1 Introduction to SQL Select-From-Where Statements Multirelation Queries Subqueries.
SQL Queries Principal form: SELECT desired attributes FROM tuple variables –– range over relations WHERE condition about tuple variables; Running example.
Winter 2002Arthur Keller – CS 1806–1 Schedule Today: Jan. 22 (T) u SQL Queries. u Read Sections Assignment 2 due. Jan. 24 (TH) u Subqueries, Grouping.
SQL CSET 3300.
Relational Algebra (end) SQL April 19 th, Complex Queries Product ( pid, name, price, category, maker-cid) Purchase (buyer-ssn, seller-ssn, store,
1 Database Systems Relations as Bags Grouping and Aggregation Database Modification.
1 Introduction to SQL Multirelation Queries Subqueries Slides are reused by the approval of Jeffrey Ullman’s.
1 Lecture 12: SQL Friday, October 26, Outline Simple Queries in SQL (5.1) Queries with more than one relation (5.2) Subqueries (5.3) Duplicates.
From Relational Algebra to the Structured Query Language Rose-Hulman Institute of Technology Curt Clifton.
IS698: Database Management Min Song IS NJIT. Overview  Query processing  Query Optmization  SQL.
SQL. 1.SQL is a high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation details that would be necessary in.
Fall 2001Arthur Keller – CS 1806–1 Schedule Today (TH) Bags and SQL Queries. u Read Sections Project Part 2 due. Oct. 16 (T) Duplicates, Aggregation,
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #3.
SQL SQL is a very-high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation details that would be necessary in.
CPSC-608 Database Systems Fall 2008 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #3.
Winter 2002Arthur Keller – CS 1807–1 Schedule Today: Jan. 24 (TH) u Subqueries, Grouping and Aggregation. u Read Sections Project Part 2 due.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #2.
Complex Queries (1) Product ( pname, price, category, maker)
Chapter 6 Notes. 6.1 Simple Queries in SQL SQL is not usually used as a stand-alone language In practice there are hosting programs in a high-level language.
SQL 2014, Fall Pusan National University Ki-Joune Li These slides are made from the materials that Prof. Jeffrey D. Ullman distributes via his course web.
SCUHolliday6–1 Schedule Today: u SQL Queries. u Read Sections Next time u Subqueries, Grouping and Aggregation. u Read Sections And then.
Databases : SQL-Introduction 2007, Fall Pusan National University Ki-Joune Li These slides are made from the materials that Prof. Jeffrey D. Ullman distributes.
Onsdag The concepts in a relation data model SQL DDL DML.
Computational Biology Dr. Jens Allmer Lecture Slides Week 6.
Databases 1 Second lecture.
1 CSCE Database Systems Anxiao (Andrew) Jiang The Database Language SQL.
1 Introduction to SQL Database Systems. 2 Why SQL? SQL is a very-high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation.
Introduction to SQL Introduction Select-From-Where Statements Queries over Several Relations Subqueries.
Himanshu GuptaCSE 532-SQL-1 SQL. Himanshu GuptaCSE 532-SQL-2 Why SQL? SQL is a very-high-level language, in which the programmer is able to avoid specifying.
SCUHolliday - coen 1787–1 Schedule Today: u Subqueries, Grouping and Aggregation. u Read Sections Next u Modifications, Schemas, Views. u Read.
More SQL (and Relational Algebra). More SQL Extended Relational Algebra Outerjoins, Grouping/Aggregation Insert/Delete/Update.
Databases : SQL Multi-Relations 2007, Fall Pusan National University Ki-Joune Li These slides are made from the materials that Prof. Jeffrey D. Ullman.
1 Introduction to Database Systems, CS420 SQL JOIN, Aggregate, Grouping, HAVING and DML Clauses.
1 Database Design: DBS CB, 2 nd Edition SQL: Select-From-Where Statements & Multi-relation Queries & Subqueries Ch. 6.
Select-From-Where Statements Multirelation Queries Subqueries
Summary of Relational Algebra
Schedule Today: Jan. 28 (Mon) Jan. 30 (Wed) Next Week Assignments !!
Slides are reused by the approval of Jeffrey Ullman’s
CPSC-310 Database Systems
Computational Biology
Outerjoins, Grouping/Aggregation Insert/Delete/Update
Databases : More about SQL
CPSC-310 Database Systems
Relational Algebra at a Glance
Schedule Today: Next After that Subqueries, Grouping and Aggregation.
Introduction to Database Systems, CS420
CPSC-608 Database Systems
CS 440 Database Management Systems
CPSC-608 Database Systems
IST 210: Organization of Data
CPSC-310 Database Systems
IT 244 Database Management System
2018, Fall Pusan National University Ki-Joune Li
SQL Introduction Standard language for querying and manipulating data
Where are we? Until now: Modeling databases (ODL, E/R): all about the schema Now: Manipulating the data: queries, updates, SQL Then: looking inside -
Lecture 3 Monday, April 8, 2002.
CS4433 Database Systems SQL - Basics.
CPSC-608 Database Systems
CPSC-608 Database Systems
More SQL Extended Relational Algebra Outerjoins, Grouping/Aggregation
Lecture 3: Relational Algebra and SQL
CPSC-608 Database Systems
CMSC-461 Database Management Systems
Instructor: Zhe He Department of Computer Science
Select-From-Where Statements Multirelation Queries Subqueries
Presentation transcript:

06a: SQL-1 The Basics– Select-From-Where CS411 Database Systems 06a: SQL-1 The Basics– Select-From-Where

SQL Introduction Standard language for querying and manipulating data Structured Query Language Many standards out there: SQL92, SQL2, SQL3, SQL99 Vendors support various subsets of these, but all of what we’ll be talking about.

Why SQL? SQL is a high-level “declarative” language the programmer is able to avoid specifying a lot of data-manipulation details that would be necessary in languages like C++. But it is “restricted” – can’t do everything you can in a programming language Due to which its queries are “optimized” quite well, yielding efficient query executions. And it is “powerful” – can do most things you would want to with data

Select-From-Where Statements The principal form of a query is: SELECT desired attributes FROM one or more tables WHERE condition about tuples of the tables

Single-Relation Queries

Example Most of our SQL queries will be based on the following database schema. Underline indicates key attributes. Beers(name, manf) Bars(name, addr, license) Customers(name, addr, phone) Likes(customer, beer) Sells(bar, beer, price) Frequents(customer, bar)

Example Using Beers(name, manf), which beers are made by Anheuser-Busch? SELECT name FROM Beers WHERE manf = ‘Anheuser-Busch’;

Result of Query name ‘Bud’ ‘Bud Lite’ ‘Michelob’ The answer is a relation with a single attribute, name, and tuples with the name of each beer by Anheuser-Busch, such as Bud. SELECT name FROM Beers WHERE manf = ‘Anheuser-Busch’;

Meaning of Single-Relation Query Begin with the relation in the FROM clause. Apply the selection indicated by the WHERE clause. Apply the projection indicated by the SELECT clause. SELECT name FROM Beers WHERE manf = ‘Anheuser-Busch’;

Operational Semantics Think of a tuple variable ranging over each tuple of the relation mentioned in FROM. Check if the “current” tuple satisfies the WHERE clause. If so, compute the attributes of the SELECT clause using the components of this tuple. SELECT name FROM Beers WHERE manf = ‘Anheuser-Busch’;

* In SELECT clauses When there is one relation in the FROM clause, * in the SELECT clause stands for “all attributes of this relation.” Example using Beers(name, manf): SELECT * FROM Beers WHERE manf = ‘Anheuser-Busch’;

Result of Query: name manf ‘Bud’ ‘Anheuser-Busch’ ‘Bud Lite’ ‘Anheuser-Busch’ ‘Michelob’ ‘Anheuser-Busch’ Now, the result has each of the attributes of Beers. SELECT * FROM Beers WHERE manf = ‘Anheuser-Busch’;

Renaming Attributes If you want the result to have different attribute names, use “AS <new name>” to rename an attribute. Example based on Beers(name, manf): SELECT name AS beer, manf FROM Beers WHERE manf = ‘Anheuser-Busch’;

Result of Query: beer manf ‘Bud’ ‘Anheuser-Busch’ ‘Bud Lite’ ‘Anheuser-Busch’ ‘Michelob’ ‘Anheuser-Busch’ SELECT name AS beer, manf FROM Beers WHERE manf = ‘Anheuser-Busch’;

Expressions in SELECT Clauses Any expression that makes sense can appear as an element of a SELECT clause. Example: from Sells (bar, beer, price): SELECT bar, beer, price * 120 AS priceInYen FROM Sells;

Result of Query bar beer priceInYen Joe’s Bud 300 Sue’s Miller 360 … … … SELECT bar, beer, price * 120 AS priceInYen FROM Sells;

Complex Conditions in WHERE Clause From Sells (bar, beer, price), find the price Joe’s Bar charges for Bud: SELECT price FROM Sells WHERE bar = ‘joe bar’ AND beer = ‘Bud’;

More Syntax in the WHERE clause What you can use in WHERE: attribute names of the relation(s) used in the FROM. comparison operators: =, <>, <, >, <=, >= apply arithmetic operations: stockprice*2 operations, comparisons on strings pattern matching: s LIKE p special stuff for comparing dates and times. See the textbook for more… Then, create bigger expressions using Boolean connectives

Syntax (cont’d) Two single quotes inside a string represent the single-quote (apostrophe). SQL is case-insensitive. In general, upper and lower case characters are the same, except inside quoted strings.

Syntax: Patterns and “LIKE” WHERE clauses can have conditions in which a string is compared with a pattern, to see if it matches. General form: <Attribute> LIKE <pattern> or <Attribute> NOT LIKE <pattern> Pattern is a quoted string with % = “any string”; _ = “any character.”

Example From Customers(name, addr, phone) find the drinkers with middle three numbers 555: SELECT name FROM Customers WHERE phone LIKE ‘%555-_ _ _ _’;

Motivating Example for Next Few Slides From the following Sells relation: bar beer price .... .... ... SELECT bar FROM Sells WHERE price < 2.00 OR price >= 2.00; What should this return?

Null Values

NULL Values Tuples in SQL relations can have NULL as a value for one or more components. Meaning depends on context. Two common cases: Missing value : e.g., we know Joe’s Bar has some address, but we don’t know what it is. Inapplicable : e.g., the value of attribute spouse for an unmarried person.

Comparing NULL’s to Values The logic of conditions in SQL is really 3-valued logic: TRUE, FALSE, UNKNOWN. Comparison: When any value is compared with NULL, the truth value is UNKNOWN. Outcome: But a query only produces a tuple in the answer if its truth value for the WHERE clause is TRUE (not FALSE or UNKNOWN).

Three-Valued Logic To understand how AND, OR, and NOT work in 3-valued logic, think of TRUE = 1, FALSE = 0, and UNKNOWN = ½. AND = MIN; OR = MAX, NOT(x) = 1-x. Example: TRUE AND (FALSE OR NOT(UNKNOWN)) = MIN(1, MAX(0, (1 - ½ ))) = MIN(1, MAX(0, ½ )) = MIN(1, ½ ) = ½ = UNKNOWN.

Example From the following Sells relation: bar beer price Joe’s Bar Bud NULL SELECT bar FROM Sells WHERE price < 2.00 OR price >= 2.00; A surprising result! UNKNOWN UNKNOWN UNKNOWN

Reason: 2-Valued Laws != 3-Valued Laws Some common laws, like the commutativity of AND, hold in 3-valued logic. p AND q = q AND p But others do not; example: p OR NOT p = TRUE. When p = UNKNOWN, the left side is MAX( ½, (1 – ½ )) = ½ =UNKNOWN.

Testing for Null Instead of relying on there not being NULLs or getting the default behavior for NULLs, can override this. Can test for NULL explicitly: x IS NULL x IS NOT NULL SELECT * FROM Person WHERE age < 25 OR age >= 25 OR age IS NULL Now it includes all Persons

Multi-Relation Queries

Multi-relation Queries Interesting queries often combine data from more than one relation. We can address several relations in one query by listing them all in the FROM clause. Distinguish attributes of the same name by “<relation>.<attribute>”

Example Using relations Likes(customer, beer) and Frequents(customer, bar), find the beers liked by customers who frequent Joe’s Bar. Tip: Always prefix with relation name to make it clear/easier to read. But optional! SELECT Likes.beer FROM Likes, Frequents WHERE Frequents.bar = ‘Joe Bar’ AND Frequents.customer = Likes.customer;

Relational Algebra Expression Tree? SELECT Likes.beer FROM Likes, Frequents WHERE Frequents.bar = ‘Joe Bar’ AND Frequents.customer = Likes.customer; What would the relational algebra expression look like? PI_beer (SIGMA(bar = “joe bar”) (Likes NJ Frequents)) Frequents x Likes -> Join -> Select_{Bar = Joe}

Another Example Product (pname, price, category, maker) Purchase (buyer, seller, store, product) Company (cname, stockPrice, country) Person (pname, phoneNumber, city) Find names of people living in Champaign that bought gizmo products, and the names of the stores they bought from

Another Example Product (prname, price, category, maker) Purchase (buyer, seller, store, product) Company (cname, stockPrice, country) Person (pname, phoneNumber, city) Find names of people living in Champaign that bought gizmo products, and the names of the stores they bought from SELECT pname, store FROM Person, Purchase, Product WHERE pname=buyer AND city=“Champaign” AND product = prname AND category=“gizmo”

Disambiguating Attributes Find phone numbers of people buying telephony products: Product (name, price, category, maker) Purchase (buyer, seller, store, product) Person (name, phoneNumber, city) SELECT Person.phoneNumber FROM Person, Purchase, Product WHERE Person.name=Purchase.buyer AND Purchase.product=Product.name AND Product.category=“telephony”

Operational Semantics Almost the same as for single-relation queries: Start with the product of all the relations in the FROM clause. Apply the selection condition from the WHERE clause. Project onto the list of attributes and expressions in the SELECT clause.

Explicit Tuple-Variables Sometimes, a query needs to use two copies of the same relation. Distinguish copies by following the relation name by the name of a tuple-variable, in the FROM clause.

Example SELECT s1.bar FROM Sells s1, Sells s2 WHERE s1.beer = s2.beer AND s1.price < s2.price; What does this translate to?

Meaning (Semantics) of SQL Queries SELECT a1, a2, …, ak FROM R1, R2, …, Rn WHERE Conditions 1. Translation to Relational algebra: a1,…,ak ( s Conditions (R1 x R2 x … x Rn)) Select-From-Where queries are precisely Join-Select-Project

Meaning (Semantics) of SQL Queries SELECT a1, a2, …, ak FROM R1, R2, …, Rn WHERE Conditions 2. Nested loops: Answer = {} for x1 in R1 do for x2 in R2 do ….. for xn in Rn do if Conditions then Answer = Answer U {(a1,…,ak)} return Answer

Exercises Product ( pname, price, category, maker) Purchase (buyer, seller, store, product) Company (cname, stock price, country) Person( name, phone number, city) Ex: Find names of people who bought American products

Subqueries Boolean Operators IN, EXISTS, ANY, ALL

Subqueries A parenthesized SELECT-FROM-WHERE statement (subquery) can be used as a value in a number of places, including FROM and WHERE clauses.

Subqueries that Return Scalar If a subquery is guaranteed to produce one tuple with one component, then the subquery can be used as a value. “Single” tuple often guaranteed by key constraint. A run-time error occurs if there is no tuple or more than one tuple.

Example From Sells(bar, beer, price), find the bars that serve Miller for the same price Joe charges for Bud. Two queries would surely work: Find the price Joe charges for Bud. Find the bars that serve Miller at that price.

Query + Subquery Solution SELECT bar FROM Sells WHERE beer = ‘Miller’ AND price = (SELECT price WHERE bar = ‘Joe Bar’ AND beer = ‘Bud’);

The IN Operator <tuple> IN <relation> is true if and only if the tuple is a member of the relation. <tuple> NOT IN <relation> means the opposite. IN-expressions can appear in WHERE clauses. The <relation> is often a subquery.

Example From Beers(name, manf) and Likes(customer, beer), find the name and manufacturer of each beer that Fred likes. SELECT * FROM Beers WHERE name IN (SELECT beer FROM Likes WHERE customer = ‘Fred’); The set of beers Fred likes

The Exists Operator EXISTS( <relation> ) is true if and only if the <relation> is not empty. Being a boolean-valued operator, EXISTS can appear in WHERE clauses. Example: From Beers(name, manf), find those beers that are the only beer by their manufacturer.

Example Query with EXISTS SELECT name FROM Beers b1 WHERE NOT EXISTS ( SELECT * FROM Beers WHERE manf = b1.manf AND name <> b1.name); Notice scope rule: manf refers to closest nested FROM with a relation having that attribute. Set of beers with the same manf as b1, but not the beer Read “Correlated Subqueries” Section 6.3.4.

The Operator ANY x = ANY( <relation> ) is a boolean condition meaning that x equals at least one tuple in the relation. Similarly, = can be replaced by any of the comparison operators. Example: x >= ANY( <relation> ) means x is greater than or equal to at least one tuple in the relation. Note tuples must have one component only.

The Operator ALL Similarly, x <> ALL( <relation> ) is true if and only if for every tuple t in the relation, x is not equal to t. That is, x is not a member of the relation. The <> can be replaced by any comparison operator. Example: x >= ALL( <relation> ) means there is x is larger than every tuple in the relation.

Example From Sells(bar, beer, price), find the beer(s) sold for the highest price. SELECT beer FROM Sells WHERE price >= ALL( SELECT price FROM Sells); price from the outer Sells must not be less than any price.

Relations as Bags

Relational Algebra: Operations on Bags (and why we care) Union: {a,b,b,c} U {a,b,b,b,e,f,f} = {a,a,b,b,b,b,b,c,e,f,f} add the number of occurrences Difference: {a,b,b,b,c,c} – {b,c,c,c,d} = {a,b,b} subtract the number of occurrences Intersection: {a,b,b,b,c,c} {b,b,c,c,c,c,d} = {b,b,c,c} minimum of the two numbers of occurrences Selection: preserve the number of occurrences Projection: preserve the number of occurrences (no duplicate elimination) Cartesian product, join: no duplicate elimination Read Section 5.3 of the book for more detail

Bag Semantics for SFW Queries The SELECT-FROM-WHERE statement uses bag semantics Selection: preserve the number of occurrences Projection: preserve the number of occurrences (no duplicate elimination) Cartesian product, join: no duplicate elimination

Union, Intersection, and Difference Union, intersection, and difference of relations are expressed by the following forms, each involving subqueries: ( subquery ) UNION ( subquery ) ( subquery ) INTERSECT ( subquery ) ( subquery ) EXCEPT ( subquery )

Example From relations Likes(customer, beer), Sells(bar, beer, price) and Frequents(customer, bar), find the customers and beers such that: The customer likes the beer, and The customer frequents at least one bar that sells the beer. How would we do this?

Solution (SELECT * FROM Likes) INTERSECT (SELECT customer, beer The customer frequents a bar that sells the beer. (SELECT * FROM Likes) INTERSECT (SELECT customer, beer FROM Sells, Frequents WHERE Frequents.bar = Sells.bar );

Bag Semantics for Set Operations in SQL Although the SELECT-FROM-WHERE statement uses bag semantics, the default for union, intersection, and difference is set semantics. That is, duplicates are eliminated as the operation is applied.

Motivation: Efficiency When doing projection in relational algebra, it is easier to avoid eliminating duplicates. Just work tuple-at-a-time. When doing intersection or difference, it is most efficient to sort the relations first. At that point you may as well eliminate the duplicates anyway. Even though union can be done simpler, it’s lumped in with intersection and difference since it’s also a set-oriented operation

Controlling Duplicate Elimination Force the result to be a set by SELECT DISTINCT . . . Force the result to be a bag (i.e., don’t eliminate duplicates) by ALL, as in . . . UNION ALL . . .

Example: DISTINCT From Sells(bar, beer, price), find all the different prices charged for beers: SELECT DISTINCT price FROM Sells; Notice that without DISTINCT, each price would be listed as many times as there were bar/beer pairs at that price.