Suppose that a DBMS recognizes increment, which increments an in- teger-valued object by 1, and decrement as actions, in addition to reads and writes. A transaction that increments an object need not know the value of the object; incre- ment and decrement are versions of blind writes. In addition to shared and exclusive locks, two special locks are supported: An object must be locked in I mode before incrementing it and locked in D mode before decrementing it. An I lock is compatible with another I or D lock on the same object, but not with S and X locks. 1. Illustrate how the use of I and D locks can increase concurrency. (Show a schedule allowed by Strict 2PL that only uses S and X locks. Explain how the use of I and D locks can allow more actions to be interleaved, while continuing to follow Strict 2PL.) 2. Informally explain how Strict 2PL guarantees serializability even in the presence of I and D locks. (Identify which pairs of actions conflict, in the sense that their relative order can affect the result, and show that the use of S, X, I, and D locks according to Strict 2PL orders all conflicting pairs of actions to be the same as the order in some serial schedule.)

Suppose that a DBMS recognizes increment, which increments an in- teger-valued object by 1, and decrement as actions, in addition to reads and writes. A transaction that increments an object need not know the value of the object; incre- ment and decrement are versions of blind writes. In addition to shared and exclusive locks, two special locks are supported: An object must be locked in I mode before incrementing it and locked in D mode before decrementing it. An I lock is compatible with another I or D lock on the same object, but not with S and X locks. 1. Illustrate how the use of I and D locks can increase concurrency. (Show a schedule allowed by Strict 2PL that only uses S and X locks. Explain how the use of I and D locks can allow more actions to be interleaved, while continuing to follow Strict 2PL.) 2. Informally explain how Strict 2PL guarantees serializability even in the presence of I and D locks. (Identify which pairs of actions conflict, in the sense that their relative order can affect the result, and show that the use of S, X, I, and D locks according to Strict 2PL orders all conflicting pairs of actions to be the same as the order in some serial schedule.)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

TASK 2 Write an anonymous block that demonstrates the use of a predefined Oracle server exception when an attempt is made to select all employees from the EMP who have a NULL department number.
Suppose that a DBMS recognizes increment, which increments an in- teger-valued object by 1, and decrement as actions, in addition to reads and writes. A transaction that increments an object need not know the value of the object; incre- ment and decrement are versions of blind writes. In addition to shared and exclusive locks, two special locks are supported: An object must be locked in I mode before incrementing it and locked in D mode before decrementing it. An I lock is compatible with another I or D lock on the same object, but not with S and X locks. 1. Illustrate how the use of I and D locks can increase concurrency. (Show a schedule allowed by Strict 2PL that only uses S and X locks. Explain how the use of I and D locks can allow more actions to be interleaved, while continuing to follow Strict 2PL.) 2. Informally explain how Strict 2PL guarantees serializability even in the presence of I and D locks. (Identify which pairs of actions conflict, in the sense that their relative…
Discuss the security concerns associated with object serialization. What measures can be taken to secure serialized data?
Since pointers in a blockchain include a cryptographic hash of the previousblock, why is there the additional need for replication of the blockchain toensure immutability?
Suppose we have a record file constructed according to the SimpleDB specificapoints) Suppose we have a record file constructed according to the SimpleDB specifications. That is, the block size is 400 bytes, an integer occupies 4 bytes, a string requires an integer length plus one byte per character, and each slot of a record page has an integer INUSE/EMPTY flag; records do not span multiple pages. For each of the tables in the sample database (and assuming there are many records in each table, not just the given sample data), determine how many records will fit per block (be sure to show your calculations). Is there any wasted space in any of the blocks?tions. That is, the block size is 400 bytes, an integer occupies 4 bytes, a string requires an integer length plus one byte per character, and each slot of a record page has an integer INUSE/EMPTY flag; records do not span multiple pages. For each of the tables in the sample database (and assuming there are many records in each table,…
2. DEL Transactions: The following transaction schedule is given. A,B,C are the addresses of the records in the database and T1, T2 and T3 are the transactions. T1 R(A)W(A) R(C) R(B)W(B)C T2 T3 R(B) W(B) R(C) R(B)W(B) R(A) с a) Show an example of a strict 2PL implementation that leads to a deadlock b) For a) draw a >>wait-for<< graph c) Avoid the previously drawn deadlock with a wait-die<< policy d) Give an example of another schedule that would be conflict-equivalent to the given schedule of transactions W(A)C
2. CHAPTER TRANSACTION MANAGEMENT Consider the case of immediate database approach and assume that, after a crash, the log contains the following records: Transaction Object Old Value New Value LSN L001 T1 (starts) P. 400 500 LO02 T1 300 400 LO03 T1 L004 T2 (starts) LO05 T1( commits) LO06 T3 (starts) R. 100 200 LO07 T2 700 800 LO08 T3 LO09 T4 (starts) L010 T3 (commits) T4 T. 800 900 L011 i) Which transaction(s) will be redone during recovery process? ii) Which transaction(s) will be undone during recovery process? ii) What will be the value of data item 'P' and 'T' after the recovery?
The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction. a) safety b) protection c) roll – back d) revert – back
Transactions often take a very long time to finish when an optimistic approach to concurrency management is used. Explain.
Explore the security implications of object serialization. How can serialization be vulnerable to attacks like deserialization vulnerabilities, and what measures can be taken to secure serialized data?
Explain why log records for undo-list transactions must be handled in reverse order, but redo is executed in a forward way.
Find the holes in the following authentication methods and provide a fix to the identified issue:In order to verify the authenticity of a password, Bob first generates a hash of it and then compares it to a collection of previously hashed passwords.Bob uses a hashing technique to run a password twice and then compares the results to a database of hashed passwords.