A column has a hash index and a B-tree index available. Which query condition can use the B-tree index but not the hash index?
Correct answer B. WHERE salary BETWEEN 3000 AND 5000
Subject / 929 questions
Page 31 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 31 of 47
Correct answer B. WHERE salary BETWEEN 3000 AND 5000
Correct answer C. Because the records are not sorted on that key, so every key value needs its own index entry
Correct answer A. Atomicity
Correct answer D. Durability
Correct answer B. Partially committed
Correct answer B. Read Committed
Correct answer B. R1(X) and R2(X)
Correct answer B. Edges T1 -> T2 and T2 -> T1, so S is not conflict serializable
Correct answer D. T1 then T2
Correct answer B. T1 must commit before T2 commits
Correct answer D. Acquire any new lock
Correct answer B. Exclusive locks are held until commit or abort, which removes cascading aborts
Correct answer B. T2 must wait until T1 releases its shared lock
Correct answer B. T1 waits for T2
Correct answer D. Aborts T and restarts it with a new timestamp
Correct answer B. Log records describing a change must reach stable storage before the changed data page does
Correct answer B. To limit how much of the log must be scanned and replayed after a crash
Correct answer C. Redo T1 and undo T2
Correct answer D. Both undo and redo
Correct answer C. Alternate keys