Download presentation
Presentation is loading. Please wait.
1
Managing Concurrency in Web Applications
2
DBI 2007 HUJI-CS 2 Intersection of Concurrent Accesses A fundamental property of Web sites: Concurrent accesses by multiple users Concurrent accesses intersect at –Database accesses (read / write) –Execution of application code (Servlets / JSP) Users activate the same application objects: –Database Shared connection / connection pool –Servlet / JSP object For each Servlet / JSP, only one object is created
3
DBI 2007 HUJI-CS 3 Concurrency Hazards What are the potential problems? Inconsistency due to concurrent accesses –For example, generating IDs, verifying uniqueness of names, presenting information while being updated Transactions: Want to consider a sequence of operations as an atomic action –Until commitment, updates are partial (inconsistent) –On failure, the origin state is restored (rollback) –How do we disable the server from relying on partial information or such that may later be cancelled due to roll back?
4
DBI 2007 HUJI-CS 4 Handling Concurrency For managing concurrency in the level of Java code, use known Java tools –Synchronization, wait / notify, etc. For handling concurrency in database accesses, transactions are used Concurrent transactions use distinct connections But (generating) connections are expensive! –Use thread pools –Share connections whenever possible (e.g., simple reads)
5
DBI 2007 HUJI-CS 5 Thumbnail Rules Some concurrency problems can be solved at both the code and database levels In principle, prefer letting the database handle concurrency –Database research and vendors have put a lot of effort on handling concurrent transactions But you need to understand the exact model of transaction management that is implemented by your specific database engine –Next, transaction management in PostgreSQL
6
Transactions in PostgreSQL / JDBC
7
DBI 2007 HUJI-CS 7 Transactions and JDBC Transaction:Transaction: A sequence of statements that must all succeed (or all fail) together –e.g., updating several tables due to customer purchase Failure : System must reverse all previous actions Cannot leave DB in inconsistent state halfway through a transaction COMMIT = complete transaction ROLLBACK = cancel all actions
8
DBI 2007 HUJI-CS 8 An Example Suppose that we want to transfer money from bank account 13 to account 72: PreparedStatement pstmt = con.prepareStatement("update BankAccount set amount = amount + ? where accountId = ?"); pstmt.setInt(1,-100); pstmt.setInt(2, 13); pstmt.executeUpdate(); pstmt.setInt(1, 100); pstmt.setInt(2, 72); pstmt.executeUpdate(); What happens if this update fails?
9
DBI 2007 HUJI-CS 9 Transaction Life Cycle Through JDBC, transactions are not opened and closed explicitly A transaction starts on 1 st (successful) command –After a connection is established –After the previous transaction ends A transaction ends when COMMIT or ROLLBACK are applied –Either explicitly or implicitly (next slides) Multiple transactions are obtained by using multiple connections to the database
10
DBI 2007 HUJI-CS 10 Committing a Transaction How do we commit? Explicitly invoking Connection.commit() Implicitly –After every query execution, if AutoCommit is true –When the user normally disconnects (i.e., appropriately closes the connection) –In some DBs: After invoking a DDL command (CREATE, DROP, RENAME, ALTER, …)
11
DBI 2007 HUJI-CS 11 Automatic Commitment A Connection object has a boolean AutoCommit If AutoCommit is true (default), then every statement is automatically committed If AutoCommit is false, then each statement is added to an ongoing transaction Change using setAutoCommit(boolean) If AutoCommit is false, need to explicitly commit or rollback the transaction using Connection.commit() and Connection.rollback()
12
DBI 2007 HUJI-CS 12 Rolling Back Rolling Back: Undoing any change to data within the current transaction The ROLLBACK command explicitly rolls back (and ends) the current transaction ROLLBACK is implicitly applied when the user abnormally disconnects (i.e., without appropriately closing the connection)
13
DBI 2007 HUJI-CS 13 Fixed Example con.setAutoCommit(false); try { PreparedStatement pstmt = con.prepareStatement("update BankAccount set amount = amount + ? where accountId = ?"); pstmt.setInt(1,-100); pstmt.setInt(2, 13); pstmt.executeUpdate(); pstmt.setInt(1, 100); pstmt.setInt(2, 72); pstmt.executeUpdate(); con.commit(); catch (SQLException e) { con.rollback(); …; }
14
Transaction Isolation
15
DBI 2007 HUJI-CS 15 Isolation Issues How do different transactions interact? Does a running transaction see uncommitted changes? Does it see committed changes? Can two transactions update the same row? –Next part …
16
DBI 2007 HUJI-CS 16 Isolation Levels The isolation level determines the capabilities of a transaction to read/write data that is accessed by other transactions In PostgreSQL, two levels of isolation: 1.READ COMMITTED (default) 2.SERIALIZABLE Each transaction determines its isolation level –Connection.setTransactionIsolation(int level)
17
DBI 2007 HUJI-CS 17 READ COMMITED & SERIALIZABLE In principle, a query in PostgreSQL never reads uncommitted (i.e. dirty) data SERIALIZABLE: During the whole transaction, statements read only the changes that were committed by the time the transaction begun (and the changes made by the transaction itself) READ COMMITTED: A statement reads the data that was committed by the time the statement (not the transaction) begun
18
DBI 2007 HUJI-CS 18 Some Definitions Dirty reads:Dirty reads: A transaction reads data that is written by another, uncommitted transaction Non-repeatable reads:Non-repeatable reads: A transaction rereads data it previously read and finds that a committed transaction has modified or deleted that data Phantom reads:Phantom reads: A transaction re-executes a query returning a set of rows satisfying a search condition and finds that a committed transaction inserted additional rows that satisfy the condition
19
DBI 2007 HUJI-CS 19 READ COMMITED vs. SERIALIZABLE SERIALIZABLE READ COMMITED Impossible Dirty Reads ImpossiblePossible Non-repeatable Reads ImpossiblePossiblePhantom Reads
20
DBI 2007 HUJI-CS 20 What Happens Here (1)? 1. 1. CREATE TABLE pairs (x INTEGER, y INTEGER); 2. 2. select * from pairs 3. 3. insert into pairs values(1,1) 6. 6. select * from pairs 8. 8. COMMIT 2. select * from pairs 3. insert into pairs values(1,1) 6. select * from pairs 8. COMMIT 4. 4. select * from pairs 5. 5. insert into pairs values(1,2) 7. 7. select * from pairs 9. 9. COMMIT 4. select * from pairs 5. insert into pairs values(1,2) 7. select * from pairs 9. COMMIT T.1: R. COMMITTED T.2: SERIALIZABLE
21
DBI 2007 HUJI-CS 21 What Happens Here (2)? 1. 1. CREATE TABLE pairs (x INTEGER, y INTEGER); T.1: R. COMMITTED T.2: SERIALIZABLE 3. 3. insert into pairs values(1,1) 4. 4. COMMIT 5. 5. select * from pairs 9. 9. select * from pairs 10. 10. COMMIT 3. insert into pairs values(1,1) 4. COMMIT 5. select * from pairs 9. select * from pairs 10. COMMIT 2. 2. select * from pairs 6. 6. select * from pairs 7. 7. insert into pairs values(1,2) 8. 8. COMMIT 2. select * from pairs 6. select * from pairs 7. insert into pairs values(1,2) 8. COMMIT
22
DBI 2007 HUJI-CS 22 What Happens Here (3)? 1. 1. CREATE TABLE pairs (x INTEGER, y INTEGER); 2. 2. insert into pairs values(1,1) 4. 4. COMMIT 5. 5. select * from pairs 9. 9. select * from pairs 10. 10. COMMIT 2. insert into pairs values(1,1) 4. COMMIT 5. select * from pairs 9. select * from pairs 10. COMMIT 3. 3. select * from pairs 6. 6. select * from pairs 7. 7. insert into pairs values(1,2) 8. 8. COMMIT 3. select * from pairs 6. select * from pairs 7. insert into pairs values(1,2) 8. COMMIT T.1: SERIALIZABLE T.2: SERIALIZABLE Is it equivalent to any truly serial execution of the transactions?
23
Updates by Concurrent Transactions
24
DBI 2007 HUJI-CS 24Locks PostgreSQL controls concurrent access to data by deploying locks Each operation on the database (select, update, insert, create, drop, etc.) requires some lock to be obtained by the running transaction –If a lock is not available, the transaction is blocked –Some operations may specify NOWAIT, i.e., fail if the lock is not available Locks are applied to either whole tables or to (sets of) specific rows
25
DBI 2007 HUJI-CS 25 Table-Level Locks Several types of table locks –For example, ACCESS and ROW For each lock type, two versions: –Shared: Can be held by multiple transactions –Exclusive: Other transactions cannot have this lock (shared or exclusive) Some locks prevent locks of other types to be obtained by other transactions –For instance, the lock ACCESS EXCLUSIVE on a table conflicts with all types of keys
26
DBI 2007 HUJI-CS 26 Locking a Table To lock the table mytbl, use the command Acquires the ACCESS EXCLUSIVE lock –Thus, no transaction can read or update the table –This lock is also needed in ALTER TABLE & DROP TABLE This operation blocks until all locks on the table are released –With the addition of the optional keyword NOWAIT, this operation fails if the table is locked LOCK TABLE mytbl
27
DBI 2007 HUJI-CS 27 Row-Level Locks Row-level locks are applied to specific rows –Shared and exclusive One type: exclusive write lock –Required (and acquired automatically) whenever a row updated or deleted Querying (read) is not affected by row-level locks –Only writers are blocked (exclusive key) You can acquire a lock on a row (or set of rows) without (or before) modifying it by issuing the SELECT … FOR UPDATE query
28
DBI 2007 HUJI-CS 28 Concurrent Updates PostgreSQL disables one from updating a row that is updated by an uncommitted transaction –Table/row-level locks are held until the trans. ends –The second updating transaction is blocked until the lock is released (first one commits or rolls back) BEGIN UPDATE r END BEGIN UPDATE r END T1T1 T2T2 T 2 READ COMMITTED: Update applied when T 1 terminates T 2 SERIALIZABLE: T 1 commits: Update fails T 1 rolls back: Succeeds
29
DBI 2007 HUJI-CS 29 What Happens Here (5)? 1. 1. CREATE TABLE pairs (x INTEGER, y INTEGER); 2. 2. insert into pairs values(1,1) 3. 3. COMMIT 5. 5. update pairs set y=3 where x=1 8. 8. select * from pairs 9. 9. COMMIT 2. 2. insert into pairs values(1,1) 3. 3. COMMIT 5. 5. update pairs set y=3 where x=1 8. 8. select * from pairs 9. 9. COMMIT 4. 4. update pairs set y=2 where x=1 6. 6. select * from pairs 7. 7. COMMIT 4. 4. update pairs set y=2 where x=1 6. 6. select * from pairs 7. 7. COMMIT T.1: R. COMMITTED T.2: SERIALIZABLE
30
DBI 2007 HUJI-CS 30 What Happens Here (4)? 1. 1. CREATE TABLE pairs (x INTEGER, y INTEGER); 2. 2. insert into pairs values(1,1) 3. 3. COMMIT 5. 5. update pairs set y=3 where x=1??? 2. 2. insert into pairs values(1,1) 3. 3. COMMIT 5. 5. update pairs set y=3 where x=1??? 4. 4. update pairs set y=2 where x=1 6. 6. select * from pairs 7. 7. COMMIT 4. 4. update pairs set y=2 where x=1 6. 6. select * from pairs 7. 7. COMMIT T.1: SERIALIZABLE T.2: SERIALIZABLE
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.