1 CSCE 608-600 Database Systems Anxiao (Andrew) Jiang The Database Language SQL.

Slides:



Advertisements
Similar presentations
1 More SQL Database Modification Defining a Database Schema Views.
Advertisements

Tallahassee, Florida, 2014 COP4710 Database Systems Relational Model Fall 2014.
Chapter 7 Notes on Foreign Keys Local and Global Constraints Triggers.
Database Modifications, Data Types, Views. Database Modifications A modification command does not return a result as a query does, but it changes the.
1 More SQL Database Modification Defining a Database Schema Views Source: slides by Jeffrey Ullman.
Constraints and Triggers Foreign Keys Local and Global Constraints Triggers.
1 Constraints Foreign Keys Local and Global Constraints Triggers Source: slides by Jeffrey Ullman.
Fall 2001Arthur Keller – CS 1808–1 Schedule Today Oct. 18 (TH) Schemas, Views. u Read Sections u Project Part 3 extended to Oct. 23 (T). Oct.
1 More SQL Defining a Database Schema Views. 2 Defining a Database Schema uA database schema comprises declarations for the relations (“tables”) of the.
Winter 2002Arthur Keller – CS 1808–1 Schedule Today: Jan. 29 (T) u Modifications, Schemas, Views. u Read Sections Assignment 3 due. Jan. 31 (TH)
1 Constraints Foreign Keys Local and Global Constraints Triggers.
Winter 2002Arthur Keller – CS 1809–1 Schedule Today: Jan. 31 (TH) u Constraints. u Read Sections , Project Part 3 due. Feb. 5 (T) u Triggers,
Winter 2002Judy Cushing8–1 Schedule Jan. 30 (Wed) u Modifications, Schemas, Views. Read Sections This Week (Feb 4ff) u Constraints Read Sections.
1 Constraints Foreign Keys Local and Global Constraints Triggers.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #4.
Database Modifications A modification command does not return a result as a query does, but it changes the database in some way. There are three kinds.
CPSC-608 Database Systems Fall 2008 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #4.
Creating Tables, Defining Constraints Rose-Hulman Institute of Technology Curt Clifton.
Fall 2001Arthur Keller – CS 1809–1 Schedule Today Oct. 23 (T) Constraints. u Read Sections Assignment 4 due. Project Part 3 due Oct. 24 (W). Oct.
CPSC-608 Database Systems Fall 2008 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #3.
SQL Overview Defining a Schema CPSC 315 – Programming Studio Spring 2008 Project 1, Lecture 3 Slides adapted from those used by Jeffrey Ullman, via Jennifer.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #2.
DB Modifications Modification = insert + delete + update. Insertion of a Tuple INSERT INTO relation VALUES (list of values). Inserts the tuple = list of.
SQL: Constraints and Triggers Chapter 6 Ullman and Widom Certain properties we’d like our database to hold Modification of the database may break these.
SQL Overview Defining a Schema CPSC 315 – Programming Studio Slides adapted from those used by Jeffrey Ullman, via Jennifer Welch Via Yoonsuck Choe.
SCUHolliday - coen 1789–1 Schedule Today: u Constraints, assertions, triggers u Read Sections , 7.4. Next u Triggers, PL/SQL, embedded SQL, JDBC.
CSCE 520- Relational Data Model Lecture 2. Relational Data Model The following slides are reused by the permission of the author, J. Ullman, from the.
1 IT 244 Database Management System Lecture 11 SQL Select-From-Where Statements Meaning of queries Subqueries Ref : -A First Course in Database System.
Winter 2006Keller Ullman Cushing8–1 Turning in Assignments Please turn in hard copy (use only in the direst of circumstances). I am not your secretary.
Constraints on Relations Foreign Keys Local and Global Constraints Triggers Following lecture slides are modified from Jeff Ullman’s slides
Databases 1 Fourth lecture. Rest of SQL Defining a Database Schema Views Foreign Keys Local and Global Constraints Triggers 2.
Winter 2006Keller, Ullman, Cushing9–1 Constraints Commercial relational systems allow much more “fine-tuning” of constraints than do the modeling languages.
1 Introduction to SQL. 2 Why SQL? SQL is a very-high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation details.
CS411 Database Systems Kazuhiro Minami 06: SQL. Constraints & Triggers Foreign Keys Local and Global Constraints Triggers.
1 CS1368 Introduction* Relational Model, Schemas, SQL Semistructured Model, XML * The slides in this lecture are adapted from slides used in Standford's.
Database Management COP4540, SCS, FIU Constraints and security in SQL (Ch. 8.6, Ch22.2)
SCUHolliday - coen 1788–1 Schedule Today u Modifications, Schemas, Views. u Read Sections (except and 6.6.6) Next u Constraints. u Read.
IST 210 Constraints and Triggers. IST Constraints and Triggers Constraint: relationship among data elements DBMS should enforce the constraints.
7 1 Constraints & Triggers Chapter Constraints and triggers? Constraints: Certain properties that the DBMS is required to enforce –E.g. primary.
1 Database Systems Defining Database Schema Views.
1 Chapter 6 Constraints uForeign Keys uConstraints.
Constraints and Triggers. What’s IC? Integrity Constraints define the valid states of SQL-data by constraining the values in the base tables. –Restrictions.
CSCE 520- Relational Data Model Lecture 2. Oracle login Login from the linux lab or ssh to one of the linux servers using your cse username and password.
1 CSCE Database Systems Anxiao (Andrew) Jiang The Database Language SQL.
1 Introduction to SQL. 2 Why SQL? SQL is a very-high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation details.
More SQL (and Relational Algebra). More SQL Extended Relational Algebra Outerjoins, Grouping/Aggregation Insert/Delete/Update.
Databases : SQL-Schema Definition and View 2007, Fall Pusan National University Ki-Joune Li These slides are made from the materials that Prof. Jeffrey.
SCUHolliday - coen 1789–1 Schedule Today: u Constraints, assertions, triggers u Read Sections , 7.4. Next u Embedded SQL, JDBC. u Read Sections.
1 Introduction to Database Systems, CS420 SQL Constraints.
CENG 351 File Structures and Data Management1 Relational Model Chapter 3.
1 Constraints and Triggers in SQL. 2 Constraints are conditions that must hold on all valid relation instances SQL2 provides a variety of techniques for.
1. 2 Design of databases. E/R model (entity-relationship model) Relational model (tables) UML (unified modeling language) Database programming. SQL, Relational.
More SQL: Complex Queries, Triggers, Views, and Schema Modification
CPSC-310 Database Systems
COP4710 Database Systems Relational Model.
Foreign Keys Local and Global Constraints Triggers
CPSC-608 Database Systems
CPSC-310 Database Systems
Database Models Relational Model
CPSC-310 Database Systems
2018, Fall Pusan National University Ki-Joune Li
SQL OVERVIEW DEFINING A SCHEMA
IT 244 Database Management System
Defining a Database Schema
CMSC-461 Database Management Systems
More SQL Extended Relational Algebra Outerjoins, Grouping/Aggregation
SQL – Constraints & Triggers
CPSC-608 Database Systems
CPSC-608 Database Systems
CMSC-461 Database Management Systems
Presentation transcript:

1 CSCE Database Systems Anxiao (Andrew) Jiang The Database Language SQL

2 Defining a Database Schema A database schema comprises declarations for the relations (“tables”) of the database. Several other kinds of elements also may appear in the database schema, including views, indexes, and triggers, which we’ll introduce later.

3 Creating (Declaring) a Relation Simplest form is: CREATE TABLE ( ); To delete a relation: DROP TABLE ;

4 Elements of Table Declarations Most basic element: an attribute and its type. The most common types are: INT or INTEGER (synonyms). REAL or FLOAT (synonyms). CHAR(n ) = fixed-length string of n characters. VARCHAR(n ) = variable-length string of up to n characters.

5 Example: Create Table CREATE TABLE Sells ( storeCHAR(20), candyVARCHAR(20), priceREAL );

6 Dates and Times DATE and TIME are types in SQL. The form of a date value is: DATE ’yyyy-mm-dd’ Example: DATE ’ ’ for Sept. 30, 2004.

7 Times as Values The form of a time value is: TIME ’hh:mm:ss’ with an optional decimal point and fractions of a second following. Example: TIME ’ 15:30:02.5 ’ = two and a half seconds after 3:30PM.

8 Declaring Keys An attribute or list of attributes may be declared PRIMARY KEY or UNIQUE. Either says the attribute(s) so declared functionally determine all the attributes of the relation schema. There are a few distinctions to be mentioned later.

9 Declaring Single-Attribute Keys Place PRIMARY KEY or UNIQUE after the type in the declaration of the attribute. Example: CREATE TABLE Candies ( nameCHAR(20) UNIQUE, manfCHAR(20) );

10 Declaring Multiattribute Keys A key declaration can also be another element in the list of elements of a CREATE TABLE statement. This form is essential if the key consists of more than one attribute. May be used even for one-attribute keys.

11 Example: Multiattribute Key The store and candy together are the key for Sells: CREATE TABLE Sells ( storeCHAR(20), candyVARCHAR(20), priceREAL, PRIMARY KEY (store, candy) );

12 PRIMARY KEY Versus UNIQUE The SQL standard allows DBMS implementers to make their own distinctions between PRIMARY KEY and UNIQUE. Example: some DBMS might automatically create an index (data structure to speed search) in response to PRIMARY KEY, but not UNIQUE.

13 Required Distinctions However, standard SQL requires these distinctions: 1. There can be only one PRIMARY KEY for a relation, but several UNIQUE attributes. 2. No attribute of a PRIMARY KEY can ever be NULL in any tuple. But attributes declared UNIQUE may have NULL’s.

14 Some Other Declarations for Attributes NOT NULL means that the value for this attribute may never be NULL. DEFAULT says that if there is no specific value known for this attribute’s component in some tuple, use the stated.

15 Example: Default Values CREATE TABLE Consumers ( name CHAR(30) PRIMARY KEY, addr CHAR(50) DEFAULT ’ 123 Sesame St. ’, phone CHAR(16) );

16 Effect of Defaults --- (1) Suppose we insert the fact that Sally is a consumer, but we know neither her address nor her phone. An INSERT with a partial list of attributes makes the insertion possible: INSERT INTO Consumers(name) VALUES( ’ Sally ’ );

17 Effect of Defaults --- (2) But what tuple appears in Consumers? nameaddr phone Sally123 Sesame StNULL If we had declared phone NOT NULL, this insertion would have been rejected.

18 Adding Attributes We may add a new attribute (“column”) to a relation schema by: ALTER TABLE ADD ; Example: ALTER TABLE Stores ADD phone CHAR(16)DEFAULT ’ unlisted ’ ;

19 Deleting Attributes Remove an attribute from a relation schema by: ALTER TABLE DROP ; Example: we don’t really need the license attribute for stores: ALTER TABLE Stores DROP license;

20 Views A view is a “virtual table” = a relation defined in terms of the contents of other tables and views. Declare by: CREATE VIEW AS ; Antonym: a relation whose value is really stored in the database is called a base table.

21 Example: View Definition CanEat(consumer, candy) is a view “containing” the consumer-candy pairs such that the consumer frequents at least one store that sells the candy: CREATE VIEW CanEat AS SELECT consumer, candy FROM Frequents, Sells WHERE Frequents.store = Sells.store;

22 Example: Accessing a View Query a view as if it were a base table. Example query: SELECT candy FROM CanEat WHERE consumer = ’ Sally ’ ;

23 What Happens When a View Is Used? The DBMS starts by interpreting the query as if the view were a base table. Typical DBMS turns the query into something like relational algebra. The definitions of any views used by the query are also replaced by their algebraic equivalents, and “spliced into” the expression tree for the query.

24 Example: View Expansion PROJ candy SELECT consumer= ‘ Sally ’ CanEat PROJ consumer, candy JOIN FrequentsSells

25 DMBS Optimization It is interesting to observe that the typical DBMS will then “optimize” the query by transforming the algebraic expression to one that can be executed faster. Key optimizations: Push selections down the tree. Eliminate unnecessary projections.

26 Example: Optimization PROJ candy JOIN SELECT consumer= ’ Sally ’ Sells Frequents Notice how most tuples are eliminated from Frequents before the expensive join.

Chapter 7: Constraints and Triggers Foreign Keys Local and Global Constraints Triggers 27

28 Constraints and Triggers A constraint is a relationship among data elements that the DBMS is required to enforce. Example: key constraints. Triggers are only executed when a specified condition occurs, e.g., insertion of a tuple. Easier to implement than complex constraints.

29 Kinds of Constraints Keys. Foreign-key, or referential-integrity. Value-based constraints. Constrain values of a particular attribute. Tuple-based constraints. Relationship among components. Assertions: any SQL boolean expression.

30 Foreign Keys Consider Relation Sells(store, candy, price). We might expect that a candy value is a real candy --- something appearing in Candies.name. A constraint that requires a candy in Sells to be a candy in Candies is called a foreign -key constraint.

31 Expressing Foreign Keys Use the keyword REFERENCES, either: Within the declaration of an attribute (only for one-attribute keys). As an element of the schema: FOREIGN KEY ( ) REFERENCES ( ) Referenced attributes must be declared PRIMARY KEY or UNIQUE.

32 Example: With Attribute CREATE TABLE Candies ( nameCHAR(20) PRIMARY KEY, manfCHAR(20) ); CREATE TABLE Sells ( storeCHAR(20), candyCHAR(20) REFERENCES Candies(name), priceREAL );

33 Example: As Element CREATE TABLE Candies ( nameCHAR(20) PRIMARY KEY, manfCHAR(20) ); CREATE TABLE Sells ( storeCHAR(20), candyCHAR(20), priceREAL, FOREIGN KEY(candy) REFERENCES Candies(name));

34 Enforcing Foreign-Key Constraints If there is a foreign-key constraint from attributes of relation R to a key of relation S, two violations are possible: An insert or update to R introduces values not found in S. A deletion or update to S causes some tuples of R to “dangle.”

35 Actions Taken --- (1) Suppose R = Sells, S = Candies. An insert or update to Sells that introduces a nonexistent candy must be rejected. A deletion or update to Candies that removes a candy value found in some tuples of Sells can be handled in three ways (next slide).

36 Actions Taken --- (2) Default : Reject the modification. Cascade : Make the same changes in Sells. Deleted candy: delete Sells tuple. Updated candy: change value in Sells. Set NULL : Change the candy to NULL.

37 Example: Cascade Delete the Twizzler tuple from Candies: Then delete all tuples from Sells that have candy = ’Twizzler’. Update the Twizzler tuple by changing ’Twizzler’ to ’Twiz.’: Then change all Sells tuples with candy = ’Twizzler’ so that candy = ’Twiz.’.

38 Example: Set NULL Delete the Twizzler tuple from Candies: Change all tuples of Sells that have candy = ’Twizzler’ to have candy = NULL. Update the Twizzler tuple by changing ’Twizzler’ to ’Twiz.’: Same change.

39 Choosing a Policy When we declare a foreign key, we may choose policies SET NULL or CASCADE independently for deletions and updates. Follow the foreign-key declaration by: ON [UPDATE, DELETE][SET NULL, CASCADE] Two such clauses may be used. Otherwise, the default (reject) is used.

40 Example CREATE TABLE Sells ( storeCHAR(20), candyCHAR(20), priceREAL, FOREIGN KEY(candy) REFERENCES Candies(name) ON DELETE SET NULL ON UPDATE CASCADE );

41 Attribute-Based Checks Constraints on the value of a particular attribute. Add: CHECK( ) to the declaration for the attribute. The condition may use the name of the attribute, but any other relation or attribute name must be in a subquery.

42 Example CREATE TABLE Sells ( storeCHAR(20), candyCHAR(20)CHECK ( candy IN (SELECT name FROM Candies)), priceREAL CHECK ( price <= 5.00 ) );

43 Timing of Checks Attribute-based checks are performed only when a value for that attribute is inserted or updated. Example: CHECK (price <= 5.00) checks every new price and rejects the modification (for that tuple) if the price is more than $5. Example: CHECK (candy IN (SELECT name FROM Candies)) is not checked if a candy is deleted from Candies (unlike foreign-keys).

44 Tuple-Based Checks CHECK ( ) may be added as a relation-schema element. The condition may refer to any attribute of the relation. But any other attributes or relations require a subquery. Checked on insert or update only.

45 Example: Tuple-Based Check Only 7-11 can sell candy for more than $5: CREATE TABLE Sells ( storeCHAR(20), candyCHAR(20), priceREAL, CHECK (store = ’ 7-11 ’ OR price <= 5.00) );

46 Assertions These are database-schema elements, like relations or views. Defined by: CREATE ASSERTION CHECK ( ); Condition may refer to any relation or attribute in the database schema.

47 Example: Assertion In Sells(store, candy, price), no store may charge an average of more than $5. CREATE ASSERTION NoRipoffStores CHECK ( NOT EXISTS ( SELECT store FROM Sells GROUP BY stores HAVING AVG(price) > 5.00 )); Stores with an average price above $5

48 Example: Assertion In Consumers(name, addr, phone) and Stores(name, addr, license), there cannot be more stores than consumers. CREATE ASSERTION FewStore CHECK ( (SELECT COUNT(*) FROM Stores) <= (SELECT COUNT(*) FROM Consumers) );

49 Timing of Assertion Checks In principle, we must check every assertion after every modification to any relation of the database. A clever system can observe that only certain changes could cause a given assertion to be violated. Example: No change to Candies can affect FewStore. Neither can an insertion to Consumers.