Exam 10: Transaction Management and Concurrency Control
Exam 1: Database Systems76 Questions
Exam 2: Data Models75 Questions
Exam 3: The Relational Database Model75 Questions
Exam 4: Entity Relationship Er Modeling75 Questions
Exam 5: Advanced Data Modeling85 Questions
Exam 6: Normalization of Database Tables110 Questions
Exam 7: Introduction to Structured Query Language Sql111 Questions
Exam 8: Advanced Sql109 Questions
Exam 9: Database Design103 Questions
Exam 10: Transaction Management and Concurrency Control85 Questions
Exam 11: Database Performance Tuning and Query Optimization85 Questions
Exam 12: Distributed Database Management Systems83 Questions
Exam 13: Business Intelligence and Data Warehouses75 Questions
Exam 14: Database Connectivity and Web Technologies85 Questions
Exam 15: Database Administration and Security86 Questions
Select questions type
In the optimistic approach, during the phase, a transaction scans the database, executes the needed computations, and makes the updates to a private copy of the database values.
(Multiple Choice)
4.9/5
(34)
The interleaves the execution of database operations to ensure serializability.
(Short Answer)
4.7/5
(34)
If T1 has not unlocked data item Y, T2 cannot begin; if T2 has not unlocked data item X, T1 cannot continue. Consequently, T1 and T2 each wait for the other to unlock the required data item. Such a deadlock is also known as a(n) _____.
(Short Answer)
4.8/5
(31)
Most multiuser automatically initiate and enforce locking procedures, where all locking information is managed by the lock manager.
(Essay)
4.8/5
(44)
control is important because the simultaneous execution of transactions over a shared database can create several data integrity and consistency problems.
(Short Answer)
4.9/5
(42)
-level locks are less restrictive than database-level locks, but they create traffic jams when many transactions are waiting to access the same table.
(Short Answer)
4.7/5
(38)
Most real-world database transactions are formed by only one database request.
(True/False)
4.9/5
(37)
A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.
(True/False)
4.8/5
(30)
In the optimistic approach, during the phase, changes are permanently applied to the database.
(Multiple Choice)
4.9/5
(27)
occurs when a transaction accesses data before and after one or more other transactions finish working with such data.
(Multiple Choice)
4.8/5
(37)
A shared lock produces no conflict as long as all the concurrent transactions are read-write only.
(True/False)
4.9/5
(27)
Incomplete or improper transactions can have a devastating effect on database integrity.
(True/False)
4.9/5
(29)
A(n) lock exists when concurrent transactions are granted read access on the basis of a common lock.
(Multiple Choice)
4.9/5
(34)
A(n) condition occurs when two or more transactions wait for each other to unlock data.
(Multiple Choice)
4.7/5
(42)
A occurs when two or more transactions wait for each other to unlock data.
(Multiple Choice)
4.9/5
(36)
The multiuser DBMS must implement controls to ensure serializability and isolation of transactions, in addition to atomicity and durability, in order to guard the database's consistency and integrity.
(True/False)
4.7/5
(38)
can take place at any of the following levels: database, table, page, row, or field.
(Short Answer)
4.8/5
(35)
The occurs when two concurrent transactions, T1 and T2, are updating the same data element and one of the updates is lost.
(Short Answer)
4.9/5
(31)
The serializable isolation level is the least restrictive level defined by the ANSI SQL standard.
(True/False)
4.8/5
(28)
Showing 41 - 60 of 85
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)