Suppose we need to sort a relation of 40 GB, with 4KB blocks. Assume memory size is 40 MB, the disk seek cost is 5 milliseconds, and block transfer cost is 1 millisecond.

Assume for the above sorted relation , each block stores 40 records, and the fanout of the node is 100. Select with an equality condition on that attribute.For the following selection operations, consider which selection algorithm applies for each case, and find the number of block transfers and the number of seeks, respectively:

1. Suppose that a B+ tree index is on the key attribute, and is also the attribute used to sort the relation in 12:10.

2. Suppose that the index is not on the key attribute, but it is the attribute used to sort the relation in 12:10. Analyze its difference from 1.

3. Suppose that the index is not on the attribute used to sort the relation, but is a key attribute. Analyze its difference from 1.

4. Suppose that the index is not on the attribute used to sort the relation, and is a nonkey attribute. Analyze its difference from 1.

5. How about using linear search?