2. (11 points) Use the following schema and query plan to answer the corresponding questions R(a,b,c) S(d,e,f,g) T(h,i,j

[answerhappygod]

2 11 Points Use The Following Schema And Query Plan To Answer The Corresponding Questions R A B C S D E F G T H I J 1 (127.31 KiB) Viewed 19 times

2. (11 points) Use the following schema and query plan to answer the corresponding questions R(a,b,c) S(d,e,f,g) T(h,i,j) B(R) = 1000 B(S) = 1000 B(T) = 1000 T(R) = 10,000 T(S) = 10,000 T(T) = 10,000 Min(R,a) = 0 V(S,e) = 10 V(Th) = 100 Max(R,a) = 9000 V(S,F) = 100 V(R,b) = 100 V(Sd) = 50 V(R,C) = 20 V(S,g) = 40 (f) T a,b,c,g,lj R5 (e) g=h R4 (d) Ob=100 v b=101 R3 T (B+ tree index on h) (C) c=d R2 R1 (a) 0 a 100 a <= 1000 (b) 0e = 10 f = 1000 | R S index on (e,f)) (B+ tree index on a) (B+ tree b. Compute the cost of this query plan in terms of number of pages read from disk or written to disk. Assume that the B+ tree indexes on single columns cost 2.4 reads/lookup, the indexes on multiple columns cost 4 reads / lookup, and the buffer pool of the system can hold up to 252 frames (5 points)