In a splay tree, how is the rank of a node stored?
a. an extra array stores the information
b. a linked list stores the information
c. directly, in each node
d. indirectly, by storing the size in each node
e. the rank is not stored at all
E
You might also like to view...
The ___________________ instruction can be used to test the value of an object's property.
Fill in the blank(s) with the appropriate word(s).
The kill-wait concurrency control combines the concepts of the immediate update concurrency control and the timestamp-ordered control. As in the timestamp-ordered system, when a transaction, T1 is initiated, it is assigned a timestamp, TS(T1). However, the system uses the same conflict table as the immediate-update pessimistic control does and resolves conflicts using the rule
If transaction T1 makes a request that conflicts with an operation of active transaction, T2 if TS(T1) < TS(T2), then abort T2, else make T1 wait until T2 terminates. where abort T2 is referred to as a kill because T1 kills T2. a. Showthat the kill-wait control serializes in commit order. b. Give a schedule produced by a kill-wait control that is not serializable in timestamp order. c. Explain why deadlock does not occur in a kill-wait control.