1 A Closer Look Chapter 2. 2 Underlying Concepts of Databases and Transaction Processing.

Slides:



Advertisements
Similar presentations
CSCI 4333 Database Design and Implementation Review for Midterm Exam I
Advertisements

IS698: Database Management Min Song IS NJIT. The Relational Data Model.
1 Constraints, Triggers and Active Databases Chapter 9.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 16 – Intro. to Transactions.
Transaction Processing Lecture ACID 2 phase commit.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3 The Basic (Flat) Relational Model.
Distributed DBMSPage © 1998 M. Tamer Özsu & Patrick Valduriez Outline Introduction Background Distributed DBMS Architecture Distributed Database.
Transaction Management and Concurrency Control
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Transaction Processing IS698 Min Song. 2 What is a Transaction?  When an event in the real world changes the state of the enterprise, a transaction is.
1 Relational Model. 2 Relational Database: Definitions  Relational database: a set of relations  Relation: made up of 2 parts: – Instance : a table,
Chapter 8 : Transaction Management. u Function and importance of transactions. u Properties of transactions. u Concurrency Control – Meaning of serializability.
1 A Closer Look Underlying Concepts of Databases and Transaction Processing.
1 ACID Properties of Transactions Chapter Transactions Many enterprises use databases to store information about their state –e.g., Balances of.
1 The Big Picture of Databases We are particularly interested in relational databases Data is stored in tables.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Transaction Management WXES 2103 Database. Content What is transaction Transaction properties Transaction management with SQL Transaction log DBMS Transaction.
COMP 5138 Relational Database Management Systems Semester 2, 2007 Lecture 8A Transaction Concept.
Transaction Management and Concurrency Control
Quick Review of Apr 24 material Sorting (Sections 13.4) Sort-merge Algorithm for external sorting Join Operation implementations (sect. 13.5) –Size estimation.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 157 Database Systems I SQL Constraints and Triggers.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Transaction Management Overview Chapter 16.
1 Chapter 18 ACID Properties of Transactions. 2 Transactions Many enterprises use databases to store information about their state –e.g., Balances of.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 1: Introduction.
Lecture 2 The Relational Model. Objectives Terminology of relational model. How tables are used to represent data. Connection between mathematical relations.
Chapter 3 The Relational Model Transparencies Last Updated: Pebruari 2011 By M. Arief
Introduction. 
1 CSE 480: Database Systems Lecture 23: Transaction Processing and Database Recovery.
The Relational Model. Review Why use a DBMS? OS provides RAM and disk.
Database Technical Session By: Prof. Adarsh Patel.
DBSQL 3-1 Copyright © Genetic Computer School 2009 Chapter 3 Relational Database Model.
1 CSE 480: Database Systems Lecture 5: Relational Data Model.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 10 Transaction Management.
1 Chapter 2 The Big Picture. 2 Database Models Hierarchical Model. Network Model. Relational Model. Object/Relational Model. Object-Oriented Model. Semistructured.
CS 162 Discussion Section Week 9 11/11 – 11/15. Today’s Section ●Project discussion (5 min) ●Quiz (10 min) ●Lecture Review (20 min) ●Worksheet and Discussion.
DATABASE TRANSACTION. Transaction It is a logical unit of work that must succeed or fail in its entirety. A transaction is an atomic operation which may.
+ Constraints and triggers: maintaining the ACID properties of transactions CSCI 2141 W2013 Slides from:
FALL 2004CENG 351 File Structures and Data Management1 Relational Model Chapter 3.
1 Relational Databases and SQL. Learning Objectives Understand techniques to model complex accounting phenomena in an E-R diagram Develop E-R diagrams.
Introduction to Database Systems1. 2 Basic Definitions Mini-world Some part of the real world about which data is stored in a database. Data Known facts.
ICS 321 Fall 2011 The Database Language SQL (iv) Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 10/26/20111Lipyeow.
Computer Science and Engineering Computer System Security CSE 5339/7339 Session 21 November 2, 2004.
CSE314 Database Systems Lecture 3 The Relational Data Model and Relational Database Constraints Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson.
15.1 Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various data items. E.g. transaction to transfer.
©Silberschatz, Korth and Sudarshan14.1Database System Concepts - 6 th Edition Chapter 14: Transactions Transaction Concept Transaction State Concurrent.
Advanced Database- Dr. Arasteh1 Advanced Database Bahman Arasteh ( Ph.D, Software Engineering ) Department of Software Engineering, Azad University of.
CM Name : p.rajesh Year/Semester : VI Semester Subject : Advanced database system Subject Code : CM-603 Topic : Advanced database concepts Duration.
Mr.Prasad Sawant, MIT Pune India Introduction to DBMS.
Software System Lab. Transactions Transaction Concept A transaction is a unit of program execution that accesses and possibly updates various.
Transaction Processing Concepts Muheet Ahmed Butt.
1 Advanced Database Concepts Transaction Management and Concurrency Control.
Multidatabase Transaction Management COP5711. Multidatabase Transaction Management Outline Review - Transaction Processing Multidatabase Transaction Management.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
3 Database Systems: Design, Implementation, and Management CHAPTER 9 Transaction Management and Concurrency Control.
10 1 Chapter 10 - A Transaction Management Database Systems: Design, Implementation, and Management, Rob and Coronel.
ASET 1 Amity School of Engineering & Technology B. Tech. (CSE/IT), III Semester Database Management Systems Jitendra Rajpurohit.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 16 – Intro. to Transactions.
1 Chapter 2 The Big Picture. 2 Database Models Hierarchical Model. Network Model. Relational Model. Object/Relational Model. Object-Oriented Model. Semistructured.
CSCI-235 Micro-Computers in Science Databases. Database Concepts Data is any unorganized text, graphics, sounds, or videos A database is a collection.
Chapter 13 Managing Transactions and Concurrency Database Principles: Fundamentals of Design, Implementation, and Management Tenth Edition.
CENG 351 File Structures and Data Management1 Relational Model Chapter 3.
Chapter 2 The Big Picture. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 2-2 Databases We are particularly interested in relational databases.
Databases We are particularly interested in relational databases
Chapter 1: Introduction
SQL: Advanced Options, Updates and Views Lecturer: Dr Pavle Mogin
Transactions Properties.
Chapter 2 The Big Picture.
Chapter 10 Transaction Management and Concurrency Control
Outline Introduction Background Distributed DBMS Architecture
Transaction Management Overview
Presentation transcript:

1 A Closer Look Chapter 2

2 Underlying Concepts of Databases and Transaction Processing

3 Databases We are particularly interested in relational databases. Data is stored in tables.

4 Table Set of rows (no duplicates) Each row describes a different entity Each column states a particular fact about each entity –Each column has an associated domain Domain of Status = {fresh, soph, junior, senior} IdNameAddressStatus 1111john123 mainfresh 2222mary321 oaksoph 1234bob444 pinesoph 9999joan777 grandsenior

5 Relation Mathematical entity corresponding to a table –row ~ tuple –column ~ attribute Values in a tuple are related to each other –John lives at 123 Main Relation R can be thought of as predicate R –R(x,y,z) is true iff tuple (x,y,z) is in R

6 Operations Operations on relations are precisely defined –Take relation(s) as argument, produce new relation as result –Unary (e.g., delete certain rows) –Binary (e.g., union, Cartesian product) Corresponding operations defined on tables as well Using mathematical properties, equivalence can be decided –Important for query optimization ? op1(T1,op2(T2)) = op3(op2(T1),T2)

7 Structured Query Language: SQL Language for manipulating tables Declarative - Statement specifies goal, not how it is to be achieved (e.g., indices to use, order of operations); DBMS determines evaluation strategy –Simplifies application program But programmers should have an idea of strategies used by DBMS so they can design tables, indices, statements, in such a way that DBMS can evaluate statements efficiently

8 Structured Query Language (SQL) Language for constructing a new table from argument table(s). –FROM indicates argument(s) –WHERE indicates which rows to retain Selection (filter) –SELECT indicates which columns to extract from retained rows Projection The result is a table. SELECT FROM WHERE

9 Example SELECT Name FROM Student WHERE Id > 4999 Id Name Address Status 1234 John 123 Main fresh 5522 Mary 77 Pine senior 9876 Bill 83 Oak junior Student Name Mary Bill Result

10 Examples SELECT Id, Name FROM Student WHERE Status = ‘senior’ SELECT * FROM Student WHERE Status = ‘senior’ SELECT COUNT(*) FROM Student WHERE Status = ‘senior’ (result is not a table in this case)

11 Example Goal: table in which each row names a senior and gives a course taken and grade Combines information in two tables: –Student: Id, Name, Address, Status –Transcript: StudId, CrsCode, Semester, Grade SELECT Name, CrsCode, Grade FROM Student, Transcript WHERE StudId = Id AND Status = ‘senior’

12 Join a1a2a3 A1xxy B17rst b1b FROM T1, T2 yields: a1a2a3b1b2 A1xxy3.217 A1xxy4.817 B17rst3.217 B17rst4.817 WHERE a2 = b2 yields: B17rst3.217 B17rst4.817 SELECT a1, b1 yields result: B3.2 B4.8 T1T2 SELECT a1, b1 FROM T1, T2 WHERE a2 = b2

13 Modifying Tables UPDATE Student SET Status = ‘soph’ WHERE Id = INSERT INTO Student (Id, Name, Address, Status) VALUES ( , ‘Bill’, ‘432 pine’, ‘senior’) DELETE FROM Student WHERE Id =

14 Creating Tables CREATE TABLE Student ( Id INTEGER, Name CHAR(20), Address CHAR(50), Status CHAR(10), PRIMARY KEY (Id) )

15 Transactions Many enterprises use databases to store information about their state –E.g., balances of all depositors The occurrence of a real-world event that changes the enterprise state requires the execution of a program that changes the database state in a corresponding way –E.g., balance must be updated when you deposit A transaction is a program that accesses the database in response to real-world events

16 Transactions Transactions are not just ordinary programs Additional requirements are placed on transactions (and particularly their execution environment) that go beyond the requirements placed on ordinary programs. –Atomicity –Consistency –Isolation –Durability ACID properties

17 Integrity Constraints Rules of the enterprise generally limit the occurrence of certain real-world events. –Student cannot register for a course if current number of registrants = maximum allowed Correspondingly, allowable database states are restricted. –cur_reg <= max_reg These limitations are expressed as integrity constraints, which are assertions that must be satisfied by the database state.

18 Consistency Transaction designer must ensure that, assuming the database is in a state that satisfies all integrity constraints when execution of a transaction is started, when the transaction completes: –All integrity constraints are once again satisfied Constraints might be violated in intermediate states –New database state satisfies specifications of transaction

19 Atomicity A real-world event either happens or does not happen. –Student either registers or does not register. Similarly, the system must ensure that either the transaction runs to completion (commits) or, if it does not complete, it has no effect at all (aborts). –Not true of ordinary programs. A hardware or software failure could leave files partially updated.

20 Durability The system must ensure that once a transaction commits its effect on the database state is not lost in spite of subsequent failures. –Not true of ordinary systems. For example, a media failure after a program terminates could cause the file system to be restored to a state that preceded the execution of the program.

21 Isolation Deals with the execution of multiple transactions concurrently. If the initial database state is consistent and accurately reflects the real-world state, then the serial execution of a set of consistent transactions preserves these properties. Hence, serial execution preserves consistency. But it is inadequate from a performance perspective.

22 Concurrent Transaction Execution

23 Isolation Concurrent (interleaved) execution of a set of transactions offers performance benefits, but might not be correct. Example: course registration (cur_reg is number of current registrants) T 1 : r(cur_reg : 29) w(cur_reg : 30) T 2 : r(cur_reg : 29) w(cur_reg : 30) time  Result: Database state no longer corresponds to real-world state, integrity constraint violated.

24 Isolation The effect of concurrently executing a set of transactions must be the same as if they had executed serially (serializable) in some order. Serializable has better performance than serial, but performance might still be inadequate. Database systems offer several isolation levels with different performance characteristics -- but beware!

25 ACID Properties The transaction monitor is responsible for ensuring atomicity, durability, and (the requested level of) isolation. –Hence it provides the abstraction of failure-free, non-concurrent environment, greatly simplifying the task of the transaction designer. The transaction designer is responsible for ensuring the consistency of each transaction.