Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Intro to Database Systems > Chapter 10 > Flashcards

Chapter 10 Flashcards

1
Q

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

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Atomicity indicates the permanence of the database’s consistent state.

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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.

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

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.

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

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

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

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

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

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

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

timed

practical

-logical

physical

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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

A

Serializability

Atomicity

-Isolation

Time stamping

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

All transactions must display ____.

A

atomicity, consistency, and durability

durability and isolation

consistency, durability, and isolation

-atomicity, durability, consistency, and isolation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

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?

A

Five SQL statements are executed.

-The end of a program is successfully reached.

The program is abnormally terminated.

The database is shut down for maintenance.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

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?

A

Five SQL statements are executed.

The end of a program is successfully reached.

-The program is abnormally terminated.

The database is shut down for maintenance.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

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

A

-lost updates

disk failures

user errors

deadlocks

17
Q

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.

A

shared

common

-unrelated

locked

18
Q

The ____ manager is responsible for assigning and policing the locks used by the transactions.

A

transaction

database

-lock

schedule

19
Q

Lock ____ indicates the level of lock use.

A

-granularity

shrinking

growing

serializability

20
Q

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

A

database table

disk sector

database schema

-diskblock

21
Q

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

A

database-level

table-level

page-level

-row-level

22
Q

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

A

-shared

exclusive

binary

two-phase

23
Q

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

A

-Two transactions cannot have conflicting locks.

No unlock operation can precede a lock operation in a different transaction.

No data is affected until all locks are released.

No data is affected until the transaction is in its locked position.

24
Q

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

A

scheduled

table-locking

unique

-timestamping

25
Q

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.

A

true

26
Q

Atomicity indicates the permanence of the database’s consistent state.

A

false

27
Q

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

A

true

28
Q

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

A

true

29
Q

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

A

false

30
Q

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

A

false

31
Q

____ requires that all operations of a transaction be completed.

A

Specificity

-Atomicity

Durability

Time stamping

32
Q

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

A

RETRIEVE

ASSIGN

UPDATE

-COMMIT

33
Q

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.

A

data dictionary

metadata

rollback manager

-transaction log

34
Q

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.

A

shared

common

-unrelated

locked

35
Q

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

A

-Locks

Schedules

Stamps

Logs

36
Q

A ____ lock locks the entire diskpage.

A

transaction-level

table-level

-page-level

row-level

37
Q

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

A

database-level

table-level

page-level

-row-level

38
Q

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

A

shared lock

-exclusive lock

binary lock

deadlock

39
Q

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

A

-deadlock

exclusive lock

binary lock

two-phase lock

Intro to Database Systems (11 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions