E xercise 16.7.1: Consider a relation R(a,b,c,d) that has a clustering index on a and nonclustering indexes on each of the other attributes. The relevant parameters are: B(R) = 1000, T(R) - 5000, V (R ,a) = 20, V(R,b) = 1000, V(R,c) = 5000, and V(R,d) = 500. Give the best query plan (index-scan or table-scan followed by a filter step) and the disk-I/O cost for each of the following selections:

** Please read the Question Carefully, It asks for the Query Plan. Don;t Post already posted Solutions" on the website

a) Selection a= 1 AND b=2 AND d=3{R)- b )selection a =1 AND b=2 AND c > 3 (R )- c) selection a = l AND b<2 and c>=3(R)