#### Question Preview:

Given two relations R and S such that R contains two attributes A and B and S contains only one attribute B. Implement the division operator R/S by using other relational algebra operators (e.g., Cartesian product, projection, minus etc.). In other words, the final result obtained by your relational algebra expressions must be the same as the result obtained by R/S.
2. Suppose that a page can contain at most 4 data values and all data values are integers. Using B+ trees of order 2, give examples of each of the following:
a) a B+ tree with number of levels changed from 1 to 2 when the value...

View Complete Question >>

#### Question Preview:

Given two relations R and S such that R contains two attributes A and B and S contains only one attribute B. Implement the division operator R/S by using other relational algebra operators (e.g., Cartesian product, projection, minus etc.). In other words, the final result obtained by your relational algebra expressions must be the same as the result obtained by R/S.
2. Suppose that a page can contain at most 4 data values and all data values are integers. Using B+ trees of order 2, give examples of each of the following:
a) a B+ tree with number of levels changed from 1 to 2 when the value 60 is inserted. Show your structure before and after the insertion.
b) a B+ tree in which the deletion of the value 10 leads to a redistribution. Show your structure before and after the deletion.
3. For each of the following transactions, determine if it is conflict serializable or not? Show your working.
a. 1) W1(X), R2(X), R1(Y), R3(X), W3(Y), R3(Y), R2(Y)
b. 2) R1(X), W2(X), W2(Y), W3(Y), R1(Y)

View Less >>