Chapter 6: Integrity Constraints



Similar documents
Chapter 6: Integrity and Security. Domain Constraints

Simple SQL Queries (3)

You can use command show database; to check if bank has been created.

Comp 5311 Database Management Systems. 3. Structured Query Language 1

Advance DBMS. Structured Query Language (SQL)

Introduction to SQL ( )

SQL is capable in manipulating relational data SQL is not good for many other tasks

Chapter 7: Relational Database Design

Chapter 4: SQL. Schema Used in Examples

Introduction to database management systems

Basic Concepts. Chapter A: Network Model. Cont.) Data-Structure Diagrams (Cont( Data-Structure Diagrams. General Relationships. The DBTG CODASYL Model

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

Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification

SQL NULL s, Constraints, Triggers

Lesson 8: Introduction to Databases E-R Data Modeling

SUBQUERIES AND VIEWS. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 6

Chapter 1: Introduction. Database Management System (DBMS)

SQL DATA DEFINITION: KEY CONSTRAINTS. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 7

Lecture 6. SQL, Logical DB Design

Chapter 14: Query Optimization

Relationele Databases 2002/2003

Data Modeling. Database Systems: The Complete Book Ch ,

Chapter 7: Relational Database Design

Chapter 1: Introduction

The Relational Model. Why Study the Relational Model? Relational Database: Definitions

COMP 5138 Relational Database Management Systems. Week 5 : Basic SQL. Today s Agenda. Overview. Basic SQL Queries. Joins Queries

Review: Participation Constraints

The Structured Query Language. De facto standard used to interact with relational DB management systems Two major branches

New York University Computer Science Department Courant Institute of Mathematical Sciences

Chapter 4: SQL. Schema Used in Examples. Basic Structure. The select Clause. modifications and enhancements! A typical SQL query has the form:

IT2305 Database Systems I (Compulsory)

We know how to query a database using SQL. A set of tables and their schemas are given Data are properly loaded

Intermediate SQL C H A P T E R4. Practice Exercises. 4.1 Write the following queries in SQL:

Relational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology

IT2304: Database Systems 1 (DBS 1)

Chapter 2: Entity-Relationship Model

The Relational Model. Why Study the Relational Model? Relational Database: Definitions. Chapter 3

The Relational Model. Ramakrishnan&Gehrke, Chapter 3 CS4320 1

Outline. Data Modeling. Conceptual Design. ER Model Basics: Entities. ER Model Basics: Relationships. Ternary Relationships. Yanlei Diao UMass Amherst

Databasesystemer, forår 2005 IT Universitetet i København. Forelæsning 3: Business rules, constraints & triggers. 3. marts 2005

Boyce-Codd Normal Form

Chapter 1: Introduction

Converting E-R Diagrams to Relational Model. Winter Lecture 17

There are five fields or columns, with names and types as shown above.

CSC 443 Data Base Management Systems. Basic SQL

The Relational Model. Why Study the Relational Model?

The Relational Data Model and Relational Database Constraints

Part A: Data Definition Language (DDL) Schema and Catalog CREAT TABLE. Referential Triggered Actions. CSC 742 Database Management Systems

Functional Dependencies

Comp 3311 Database Management Systems. 2. Relational Model Exercises

CHAPTER 8: SQL-99: SCHEMA DEFINITION, BASIC CONSTRAINTS, AND QUERIES

Exercise 1: Relational Model

BCA. Database Management System

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Active database systems. Triggers. Triggers. Active database systems.

SQL: Queries, Programming, Triggers

How To Create A Table In Sql (Ahem)

CS2Bh: Current Technologies. Introduction to XML and Relational Databases. The Relational Model. The relational model

Chapter 2: Entity-Relationship Model. Entity Sets. " Example: specific person, company, event, plant

LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen

Schema Evolution in SQL-99 and Commercial (Object-)Relational DBMS

Evaluation of Expressions

B2.2-R3: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

DATABASE SECURITY, INTEGRITY AND RECOVERY

3. Relational Model and Relational Algebra

5.1 Database Schema Schema Generation in SQL

1 SQL Data Types and Schemas

Conceptual Design Using the Entity-Relationship (ER) Model

SQL: Queries, Programming, Triggers

SQL Simple Queries. Chapter 3.1 V3.0. Napier University Dr Gordon Russell

Example Instances. SQL: Queries, Programming, Triggers. Conceptual Evaluation Strategy. Basic SQL Query. A Note on Range Variables

City University of Hong Kong. Information on a Course offered by Department of Computer Science with effect from Semester A in 2014 / 2015

Introduction to Microsoft Jet SQL

The process of database development. Logical model: relational DBMS. Relation

Chapter 2: Entity-Relationship Model. E-R R Diagrams

ER modelling, Weak Entities, Class Hierarchies, Aggregation

DATABASE MANAGEMENT SYSTEMS. Question Bank:

Relational Databases

A basic create statement for a simple student table would look like the following.

EECS 647: Introduction to Database Systems

Chapter 5. SQL: Queries, Constraints, Triggers

Network Model APPENDIXD. D.1 Basic Concepts

Answers included WORKSHEET: INTEGRITY CONTROL IN RELATIONAL DATABASES

ATTACHMENT 6 SQL Server 2012 Programming Standards

The SQL Query Language. Creating Relations in SQL. Referential Integrity in SQL. Basic SQL Query. Primary and Candidate Keys in SQL

CMU - SCS / Database Applications Spring 2013, C. Faloutsos Homework 1: E.R. + Formal Q.L. Deadline: 1:30pm on Tuesday, 2/5/2013

4. SQL. Contents. Example Database. CUSTOMERS(FName, LName, CAddress, Account) PRODUCTS(Prodname, Category) SUPPLIERS(SName, SAddress, Chain)

Database System Concepts

SQL. Ilchul Yoon Assistant Professor State University of New York, Korea. on tables. describing schema. CSE 532 Theory of Database Systems

Maintaining Stored Procedures in Database Application

Introduction to Databases

Database Design. Goal: specification of database schema Methodology: E-R Model is viewed as a set of

CSI 2132 Lab 3. Outline 09/02/2012. More on SQL. Destroying and Altering Relations. Exercise: DROP TABLE ALTER TABLE SELECT

Week 4 & 5: SQL. SQL as a Query Language

Triggers & Packages. {INSERT [OR] UPDATE [OR] DELETE}: This specifies the DML operation.

Databases What the Specification Says

Graham Kemp (telephone , room 6475 EDIT) The examiner will visit the exam room at 15:00 and 17:00.

CSE 132A. Database Systems Principles

Introduction to tuple calculus Tore Risch

Instant SQL Programming

Transcription:

Chapter 6: Integrity Constraints Domain Constraints Referential Integrity Assertions Triggers Functional Dependencies Database Systems Concepts 6.1 Silberschatz, Korth and Sudarshan c 1997

Domain Constraints Integrity constraints guard against accidental damage to the database, by ensuring that authorized changes to the database do not result in a loss of data consistency. Domain constraints are the most elementary form of integrity constraint. They test values inserted in the database, and test queries to ensure that the comparisons make sense. Database Systems Concepts 6.2 Silberschatz, Korth and Sudarshan c 1997

Domain Constraints (Cont.) The check clause in SQL-92 permits domains to be restricted: Use check clause to ensure that an hourly-wage domain allows only values greater than a specified value. create domain hourly-wage numeric(5,2) constraint value-test check(value >= 4.00) The domain hourly-wage is declared to be a decimal number with 5 digits, 2 of which are after the decimal point The domain has a constraint that ensures that the hourly-wage is greater than 4.00. The clause constraint value-test is optional; useful to indicate which constraint an update violated. Database Systems Concepts 6.3 Silberschatz, Korth and Sudarshan c 1997

Referential Integrity Ensures that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation. Example: if Perryridge is a branch name appearing in one of the tuples in the account relation, then there exists a tuple in the branch relation for branch Perryridge. Formal Definition Let r 1 (R 1 ) and r 2 (R 2 ) be relations with primary keys K 1 and K 2 respectively. The subset α of R 2 is a foreign key referencing K 1 in relation r 1,ifforeveryt 2 in r 2 there must be a tuple t 1 in r 1 such that t 1 [K 1 ] = t 2 [α]. Referential integrity constraint: Π α (r 2 ) Π K1 (r 1 ) Database Systems Concepts 6.4 Silberschatz, Korth and Sudarshan c 1997

Referential Integrity in the E-R Model Consider relationship set R between entity sets E 1 and E 2. The relational schema for R includes the primary keys K 1 of E 1 and K 2 of E 2. Then K 1 and K 2 form foreign keys on the relational schemas for E 1 and E 2 respectively. Weak entity sets are also a source of referential integrity constraints. For, the relation schema for a weak entity set must include the primary key of the entity set on which it depends. Database Systems Concepts 6.5 Silberschatz, Korth and Sudarshan c 1997

Database Modification The following tests must be made in order to preserve the following referential integrity constraint: Π α (r 2 ) Π K (r 1 ) Insert. Ifatuplet 2 is inserted into r 2, the system must ensure that there is a tuple t 1 in r 1 such that t 1 [K ] = t 2 [α]. That is t 2 [α] Π K (r 1 ) Delete. If a tuple t 1 is deleted from r 1, the system must compute the set of tuples in r 2 that reference t 1 : σ α = t1 [K ] (r 2 ) If this set is not empty, either the delete command is rejected as an error, or the tuples that reference t 1 must themselves be deleted (cascading deletions are possible). Database Systems Concepts 6.6 Silberschatz, Korth and Sudarshan c 1997

Database Modification (Cont.) Update. There are two cases: If a tuple t 2 is updated in relation r 2 and the update modifies values for the foreign key α, then a test similar to the insert case is made. Let t 2 denote the new value of tuple t 2.The system must ensure that t 2 [α] Π K (r 1 ) If a tuple t 1 is updated in r 1, and the update modifies values for the primary key (K ), then a test similar to the delete case is made. The system must compute σ α = t1 [K ] (r 2 ) using the old value of t 1 (the value before the update is applied). If this set is not empty, the update may be rejected as an error, or the update may be cascaded to the tuples in the set, or the tuples in the set may be deleted. Database Systems Concepts 6.7 Silberschatz, Korth and Sudarshan c 1997

Referential Integrity in SQL Primary and candidate keys and foreign keys can be specified as part of the SQL create table statement: The primary key clause of the create table statement includes a list of the attributes that comprise the primary key. The unique key clause of the create table statement includes a list of the attributes that comprise a candidate key. The foreign key clause of the create table statement includes both a list of the attributes that comprise the foreign key and the name of the relation referenced by the foreign key. Database Systems Concepts 6.8 Silberschatz, Korth and Sudarshan c 1997

$ Referential Integrity in SQL - Example create table customer (customer-name char(20) not null, customer-street char(30), customer-city char(30), primary key (customer-name)) create table branch (branch-name char(15) not null, branch-city char(30), assets integer, primary key (branch-name)) Database Systems Concepts 6.9 Silberschatz, Korth and Sudarshan c 1997

Referential Integrity in SQL - Example (Cont.) create table account (branch-name char(15), account-number char(10) not null, balance integer, primary key (account-number), foreign key (branch-name) references branch) create table depositor (customer-name char(20) not null, account-number char(10) not null, primary key (customer-name, account-number), foreign key (account-number) references account, foreign key (customer-name) references customer ) Database Systems Concepts 6.10 Silberschatz, Korth and Sudarshan c 1997

Cascading Actions in SQL create table account... foreign key (branch-name) references branch on delete cascade on update cascade,...) Due to the on delete cascade clauses, if a delete of a tuple in branch results in referential-integrity constraint violation, the delete cascades to the account relation, deleting the tuple that refers to the branch that was deleted. Cascading updates are similar. Database Systems Concepts 6.11 Silberschatz, Korth and Sudarshan c 1997

Cascading Actions in SQL (Cont.) If there is a chain of foreign-key dependencies across multiple relations, with on delete cascade specified for each dependency, a deletion or update at one end of the chain can propagate across the entire chain. If a cascading update or delete causes a constraint violation that cannot be handled by a further cascading operation, the system aborts the transaction. As a result, all the changes caused by the transaction and its cascading actions are undone. Database Systems Concepts 6.12 Silberschatz, Korth and Sudarshan c 1997

Assertions An assertion is a predicate expressing a condition that we wish the database always to satisfy. An assertion in SQL-92 takes the form create assertion <assertion-name> check <predicate> When an assertion is made, the system tests it for validity. This testing may introduce a significant amount of overhead; hence assertions should be used with great care. Database Systems Concepts 6.13 Silberschatz, Korth and Sudarshan c 1997

Assertion Example The sum of all loan amounts for each branch must be less than the sum of all account balances at the branch. create assertion sum-constraint check (not exists (select * from branch where (select sum(amount) from loan where loan.branch-name = branch.branch-name) >= (select sum(amount) from account where loan.branch-name = branch.branch-name))) Database Systems Concepts 6.14 Silberschatz, Korth and Sudarshan c 1997

Assertion Example Every loan has at least one borrower who maintains an account with a minimum balance of $1000.00. create assertion balance-constraint check (not exists (select * from loan where not exists ( select * from borrower, depositor, account where loan.loan-number = borrower.loan-number and borrower.customer-name = depositor.customer-name and depositor.account-number = account.account-number and account.balance >= 1000))) Database Systems Concepts 6.15 Silberschatz, Korth and Sudarshan c 1997

Triggers A trigger is a statement that is executed automatically by the system as a side effect of a modification to the database. To design a trigger mechanism, we must: Specify the conditions under which the trigger is to be executed. Specify the actions to be taken when the trigger executes. The SQL-92 standard does not include triggers, but many implementations support triggers. Database Systems Concepts 6.16 Silberschatz, Korth and Sudarshan c 1997

Trigger Example Suppose that instead of allowing negative account balances, the bank deals with overdrafts by setting the account balance to zero creating a loan in the amount of the overdraft giving this loan a loan number identical to the account number of the overdrawn account The condition for executing the trigger is an update to the account relation that results in a negative balance value. Database Systems Concepts 6.17 Silberschatz, Korth and Sudarshan c 1997

Trigger Example (Cont.) define trigger overdraft on update of account T (if new T.balance < 0 then (insert into loan values (T.branch-name, T.account-number, new T.balance) insert into borrower (select customer-name, account-number from depositor where T.account-number = depositor.account-number) update account S set S.balance =0 where S.account-number = T.account-number)) The keyword new used before T.balance indicates that the value of T.balance after the update should be used; if it is omitted, the value before the update is used. Database Systems Concepts 6.18 Silberschatz, Korth and Sudarshan c 1997