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

Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct?
Build out a Database Installation Plan that takes the installation of MYSQL through installation and configuration to implement your security plan. Your plan should include a section that has test scenarios to validate the installation and configuration.
If you want to get the most out of this example, you should definitely begin by using a database that is "snapshot isolated" and is controlled by an airline. This will allow you to get the most out of this example. What if, rather than an operation that can be serialized, the improved overall performance of the airline was due to an execution that cannot be serialized?
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…
I found this question in one book, Im not able to solve it, help me
In the event that data is accessed from a node other than the primary (master) copy, there is a possibility of the database being in an inconsistent state, despite the primary (master) copy having an exclusive lock?
To store an item file with the item number as its main key, create a direct file organization using a hash function. The following table lists the primary keys of a sample collection of item file records. Assume that the blocks in the main storage area can hold a maximum of four records per block and that the buckets can hold two records each. Utilize the hash function h(k) = k mod 8, where k is the main key's numerical value. (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965
Transactions might take a long time to finish when an optimistic approach is taken to concurrency control. Explain?
Describe what happens when phantoms appear. Why might this situation, despite the usage of the two-phase locking scheme, result in an improper concurrent execution?
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. 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?
Transactions often take a very long time to finish when an optimistic approach to concurrency management is used. Explain.