CHAPTER 10: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL

1

1. Most real-world database transactions are formed by only one database request.

1

2. Although the DBMS is designed to recover a database to a previous consistent state when an interruption prevents the completion of a required set of transactions, the transactions themselves are defined by the end user or programmer and must be semantically correct.

1

3. The DBMS guarantees that the semantic meaning of a transaction truly represents the real-world event.

1

4. Atomicity indicates the permanence of the database's consistent state.

1

5. Serializability means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.

1

6. Incomplete or improper transactions can have a devastating effect on database integrity.

1

7. Durability requires that all portions of the transaction must be treated as a single, logical unit of work in which all operations are applied and completed to produce a consistent database.

1

8. 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.

1

9. The phenomenon of uncommitted data occurs when two transactions are executed concurrently and the first transaction is rolled back after the second transaction has already accessed the uncommitted data—thus violating the isolation property of transactions.

1

10. The scheduler establishes the order in which the operations within concurrent transactions are executed.

1

11. A scheduler facilitates data isolation to ensure that two transactions do not update the same data element at the same time.

1

12. A lock guarantees the open use of a data item to multiple transactions.

1

13. In a page-level lock, the DBMS will lock an entire diskpage.

1

14. A field-level lock allows concurrent transactions to access the same row, as long as they require the use of different fields within that row.

1

15. A shared lock produces no conflict as long as all the concurrent transactions are read-write only.

1

16. A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.

1

17. Timestamps must only have the single property of uniqueness.

1

18. Time stamping demands a lot of system resources because many transactions might have to be stopped, rescheduled, and stamped.

1

19. An optimistic approach is based on the assumption that the majority of the database operations do not conflict.

1

20. When using an optimistic approach, during the read phase, a transaction reads the database, executes the needed computations, and makes the updates to a private copy of the database values.

1

21. The serializable isolation level is the least restrictive level defined by the ANSI SQL standard.

1

22. The reason for the different levels of isolation is to increase transaction concurrency.

1

23. The transaction recovery write-ahead-log protocol ensures that transaction logs are always written before any database data are actually updated.

1

24. The last step in the write-through technique recovery procedure is to identify the last checkpoint in the transaction log.

1

25. A transaction is a unit of work that must be either entirely completed or aborted.

1

26. A consistent database state is .

1

27. requires that all operations of a transaction be completed.

1

28. means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.

1

29. A single-user database system automatically ensures of the database, because only one transaction is executed at a time.

1

30. The ANSI has defined standards that govern SQL database transactions. Transaction support is provided by two SQL statements: and ROLLBACK

1

31. ANSI defines four events that signal the end of a transaction. Of the following events, which is defined by ANSI as being equivalent to a COMMIT?

1

32. ANSI defines four events that signal the end of a transaction. Of the following events, which is defined by ANSI as being equivalent to a ROLLBACK?

1

33. The implicit beginning of a transaction is .

1

34. The information stored in the is used by the DBMS for a recovery requirement triggered by a ROLLBACK statement, a program’s abnormal termination, or a system failure such as a network discrepancy or a disk crash.

1

35. One of the three most common data integrity and consistency problems is .

1

36. occurs when a transaction accesses data before and after one or more other transactions finish working with such data.

1

37. As long as two transactions, T1 and T2, access data, there is no conflict, and the order of execution is irrelevant to the final outcome.

1

38. are required to prevent another transaction from reading inconsistent data.

1

39. The______ manager is responsible for assigning and policing the locks used by the transactions.

1

40. Lock indicates the level of lock use.

1

41. A lock locks the entire table preventing access to any row by a transaction while another transaction is using the table.

1

42. A lock locks the entire diskpage.

1

43. A diskpage, or page, is the equivalent of a .

1

44. A lock allows concurrent transactions to access different rows of the same table.

1

45. A(n) specifically reserves access to the transaction that locked the object.

1

46. A(n) lock exists when concurrent transactions are granted read access on the basis of a common lock

1

47. What is a rule that applies to the two-phase locking protocol?

1

48. A(n) phase in a two-phase lock is when a transaction releases all locks and cannot obtain any new lock.

1

49. A(n) condition occurs when two or more transactions wait for each other to unlock data.

1

50. The approach to scheduling concurrent transactions assigns a global unique stamp to each transaction.

1

51. In the wait/die scheme,:

1

52. 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.

1

53. In the optimistic approach, during the phase, changes are permanently applied to the database.

1

54. The isolation level ensures that queries return consistent results.

1

55. A(n) occurs when a transaction executes a query at time t1, and then it runs the same query at time t2, yielding additional rows that satisfy the query.

CIS 3365 Quiz sobre CHAPTER 10: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL, criado por Miguel Lucero em 05-04-2017.

CHAPTER 10: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL

1. Most real-world database transactions are formed by only one database request.

2. Although the DBMS is designed to recover a database to a previous consistent state when an interruption prevents the completion of a required set of transactions, the transactions themselves are defined by the end user or programmer and must be semantically correct.

3. The DBMS guarantees that the semantic meaning of a transaction truly represents the real-world event.

4. Atomicity indicates the permanence of the database's consistent state.

5. Serializability means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.

6. Incomplete or improper transactions can have a devastating effect on database integrity.

7. Durability requires that all portions of the transaction must be treated as a single, logical unit of work in which all operations are applied and completed to produce a consistent database.

8. 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.

9. The phenomenon of uncommitted data occurs when two transactions are executed concurrently and the first transaction is rolled back after the second transaction has already accessed the uncommitted data—thus violating the isolation property of transactions.

10. The scheduler establishes the order in which the operations within concurrent transactions are executed.

11. A scheduler facilitates data isolation to ensure that two transactions do not update the same data element at the same time.

12. A lock guarantees the open use of a data item to multiple transactions.

13. In a page-level lock, the DBMS will lock an entire diskpage.

14. A field-level lock allows concurrent transactions to access the same row, as long as they require the use of different fields within that row.

15. A shared lock produces no conflict as long as all the concurrent transactions are read-write only.

16. A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.

17. Timestamps must only have the single property of uniqueness.

18. Time stamping demands a lot of system resources because many transactions might have to be stopped, rescheduled, and stamped.

19. An optimistic approach is based on the assumption that the majority of the database operations do not conflict.

20. When using an optimistic approach, during the read phase, a transaction reads the database, executes the needed computations, and makes the updates to a private copy of the database values.