2. Use the following schema and query plan to answer the corresponding questions R (a,b,c) B(R)=...

 

Transcribed Image Text:

2. Use the following schema and query plan to answer the corresponding questions R (a,b,c) B(R)= 1000 T(R) = 10,000 Min (R,a) 01 Max (R,a) = 9000 V(R,b)= 100 V(R,c) : = <= 20 R1 (a) a 100 a 1000 S(d,e,f,g) B(S) = 1000 T(S) 10,000 V(S,e) = 10 V (S,f) = 100 V(S,d) = 50 V(S,g) = 40 (f) R (B+ tree index on a) (e) R4 (d) ab-100 v b=101 abcglj R5 R3 geh T(h,ij) B(T) = 1000 T(T) = 10,000 V(Th) = 100 R2 (B+ tree T(B+ tree index on h) (b) = 10 Af=1000 S index on (e,f) ) (11 points) 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) 2. Use the following schema and query plan to answer the corresponding questions R (a,b,c) B(R)= 1000 T(R) = 10,000 Min (R,a) 01 Max (R,a) = 9000 V(R,b)= 100 V(R,c) : = <= 20 R1 (a) a 100 a 1000 S(d,e,f,g) B(S) = 1000 T(S) 10,000 V(S,e) = 10 V (S,f) = 100 V(S,d) = 50 V(S,g) = 40 (f) R (B+ tree index on a) (e) R4 (d) ab-100 v b=101 abcglj R5 R3 geh T(h,ij) B(T) = 1000 T(T) = 10,000 V(Th) = 100 R2 (B+ tree T(B+ tree index on h) (b) = 10 Af=1000 S index on (e,f) ) (11 points) 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)

Answer rating: 100% (QA)

To compute the cost of the query plan in terms of t... View the full answer