Chapter 10, Database Systems: Design, Implementation, and Management 12e VERIFIED ANSWERS

Chapter 10, Database Systems: Design, Implementation, and Management 12e Atomicity - correct answers The transaction property that requires all parts of a transaction to be treated as a single, indivisible logical unit of work All parts of a transaction must be completed or the entire transaction is aborted. Atomic Transaction Property - correct answers A property that required all parts of a transaction to be treated as a single, logical unit of work in which all operations must be completed(committed) to produce a consistent database. Binary Lock - correct answers A lock that has only two states: locked(1) and unlocked(0). If a data item is locked by a transaction, no other transaction can use that data item. Buffer - correct answers Temporary storage area in primary memory used to speed up disk operations. Checkpoint - correct answers In transaction management, an operation in which the database management system writes all of its updated buffers to disk. Concurrency Control - correct answers A DBMS feature that coordinates the simultaneous execution of transaction in a multiprocessing database system while preserving data integrity. Consistency - correct answers A database condition in which all data integrity constraints are satisfied, To ensure consistency of a database, every transaction must begin with the database in a known consistent state. If not, the transaction will yield an inconsistent database that violate its integrity and business rules. Consisten Database State - correct answers A database state in which all data integrity constraints are satisfied. Database-Level Lock - correct answers A type of lock that restricts database access to the owner of the lock and allows only one user at a time to access the database, This lock works for batch processes but is unsuitable for online multiuser DMBSs. Database Recovery - correct answers The process of restoring a database to a previous consistent state. Database Request - correct answers The equivalent of a single SQL statement in an application program or a transaction. Deadlock - correct answers A condition in which two or more transactions wait indefinitely for the other to release the lock on a previously locked data item. Also called deadly embrace. Deadly Embrace - correct answers See deadlock.