Question: 1)Consider a selection query of equality on a key attribute .Assume that the primary b+ tree index on the key attribute is used in the
1)Consider a selection query of equality on a key attribute .Assume that the primary b+ tree index on the key attribute is used in the search and the tree has 100 levels how many seeks and block transfers are a needed ?
2)Difference between searching using primary b+ tree index and secondary b+ tree index ?
3)Ever serial schedule is recoverable , true or false ?
4)Ever concurrent schedule is not recoverable , true or false ?
5)Ever cascadeless schedule is recoverable , true or false ?
6)Difference between two-phase locking and strict two-phase locking protocal ?
7)difference between rigrous two-phase locking protocal and strict two-phase locking protocal ?
Answer if you know correctly only
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
