1 / 15

CSI3130

CSI3130. Transactions in PostgreSQL Fatemeh Nargesian SITE, uOttawa. What is a transaction?. A transaction is a group of SQL commands whose results will be made visible to the rest of the system as a unit when the transaction commits or not at all, if the transaction aborts .

thy
Télécharger la présentation

CSI3130

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CSI3130 Transactions in PostgreSQL Fatemeh Nargesian SITE, uOttawa

  2. What is a transaction? • A transactionis a group of SQL commands whose results will be made visible to the rest of the system as a unit when the transaction commits or not at all, if the transaction aborts. • ACID: Transactions are expected to be atomic, consistent, isolated, and durable. • PostgreSQL does not support distributed transactions, so all commands of a transaction are executed by one backend. • PostgreSQL does not handle nested transactions, either.

  3. How changes are made? • The actual tuple insertions/deletions/updates are all marked as done by transaction N as they are being made. • Concurrently running backends ignore the changes done by uncommitted transactions. • When the transaction commits, all those changes become logically visible at once.

  4. How changes are made? (Cont’d) • The control file pg_log contains 2 status bits per transaction ID, with possible states in progress, committed, aborted. • But even if the process crashes without having changed the status bits to committed, everything is safe. • The next time some backend checks the state of that transaction, it will observe that the transaction is marked in progress but is not running on any backend, deduce that it crashed, and update the pg_log entry to aborted on its behalf. • No changes are needed in any table data file during abort.

  5. Multi-version concurrency control • A PostgreSQL application sees the following behavior of concurrent transactions: • each transaction sees a snapshot (database version) as of its start time no matter what other transactions are doing while it runs. • readers do not block writers, writers do not block readers. • writers only block each other when updating the same row.

  6. Concurrent updates • Transaction A does: • UPDATE foo SET x = x + 1 WHERE rowid = 42 and before it commits, transaction B comes along and wants to do the same thing on the same row. • B clearly must wait to see if A commits or not. • If A aborts then B can go ahead, using the pre-existing value of x. But if A commits, what then? • Using the old value of x will yield a clearly unacceptable result: x ends up incremented by 1 not 2 after both transactions commit. • But if B is allowed to increment the new value of x, then B is reading data committed since it began execution. This violates the basic principle of transaction isolation.

  7. Read committed vs. serializable transaction isolation level • PostgreSQL offers two answers to the concurrent-update problem: • Read committed level • Serializable level • Serializable level is logically cleaner but requires more code in application. • By default the isolation level is set to read-committed is used in PostgreSQL. • In either case a pure SELECT transaction only sees data committed before it started. • It is just updates and deletes that are interesting.

  8. Table-level locks • If Transaction A commits while transaction B is running, PostgreSQL does not allow B to suddenly start seeing A’s updates partway through. • Even though readers and writers do not block each other under MVCC, table-level locking is still needed. • This exists mainly to prevent the entire table from being altered or deleted out from under readers or writers.

  9. Deadlock detection • Deadlock is possible if two transactions try to grab conflicting locks in different orders. • If a would-be locker sleeps for more than a second without getting the desired lock, it runs a deadlock-check algorithm that searches the lock hash table for circular lock dependencies. If it finds any, then obtaining the lock will be impossible, so it gives up and reports an error. Else it goes back to sleep and waits till granted the lock (or till client application gives up and requests transaction cancel).

  10. How to write transactions in PostgreSQL? • START TRANSACTION: start a transaction • BEGIN: start a transaction block • COMMIT: commit the current transaction • ROLLBACK:abort the current transaction • ISOLATION LEVEL { SERIALIZABLE | REPEATABLE READ | READ COMMITTED | READ UNCOMMITTED } • READ WRITE | READ ONLY

  11. Transaction was committed! BEGIN and COMMIT COMMIT; Transaction is not committed yet!

  12. ROLLBACK ROLLBACKL;

  13. Abort state Abort state: current transaction is aborted, queries ignored until end of transaction block

  14. Exercise • Create a Student database: STUDENT(SID, Lastname, Firstname, Gender) ENROLLS(SID, CID, Semester, grade) COURSE(CID, cname, level) • Insert 3 students and 2 courses; and let them enroll for the courses, for Fall 2010, no grade yet. STUDENT(100, Sue Smith, Female); STUDENT(101, Joe Appletree, Male); STUDENT(102, Joe Smith, Male) COURSE (CSI202, Database I, 2) COURSE (CSI101, Programming I, 1) ENROLLS (101, CSI101, Fall 2010, ) ENROLLS (102, CSI202, Fall 2010, ) ENROLLS (100, CSI202, Fall 2010, ) ENROLLS (102, CSI101, Fall, 2010, )

  15. Exercise • Write the following transactions in PostgreSQL: • T1: Sue Smith's last name changes to Appletree. • T2: The name of CSI101 changes to "Intro to Programming". • T3: Sue Appletree gets an A+ for CSI202. • T4: Joe Smith drops CSI101.

More Related