Given below are four statements. Match each of them with the corresponding property in the set
of ACID properties.
Statement 1 : Any data written to the database must be valid according to all the defined rules like
the check and key constraints and triggers.
Statement 2 : Every completed transaction is saved into the secondary storage.
Statement 3 : During money transfer, either the amount debited from the source account must be
credited to the destination account or the money should not be debited from the source account
at all.
Statement 4 : If multiple transactions are being executed concurrently, then the final result should
be the same irrespective of the sequence in which the transactions were executed.
Let A denote Atomicity, C denote Consistency, I denote Isolation and D denote Durability. From
among the given options, find the correct match.
A.
1 - A, 2 - C, 3 - I, 4 - D
B.
1 - C, 2 - D, 3 - A, 4 - I
C.
1 - C, 2 - D, 3 - I, 4 - A
D.
1 - A, 2 - I, 3 - D, 4 - C
A published solution is not available for this question yet.
The following key values are inserted into a B\(^{+}\) tree of order 4 in a given sequence. The tree is
initially empty.
**25,8,13,59,3,31,60,11,43**
Which of the following values appear only once in the tree?
A.
59
B.
25
C.
60
D.
11
A published solution is not available for this question yet.
The following numbers are inserted into an empty binary search tree in the given order: 27, 43, 33,
49, 81, 92, 73, 10, 78. What is the height of the resulting binary search tree?
A published solution is not available for this question yet.
Consider a **Block nested loop join** for the two relations, **instructor** and **department**.
Assuming the worst-case memory availability and **instructor** as the outer relation, the provided
details are as follows:
• Total number of block transfers: 30500
• Total number of seeks required: 2000
• Number of block in the outer relation: 500
What is the number of blocks in the inner relations?
A published solution is not available for this question yet.