This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: n c =2500, b c =500 n i =3000, b i =750 n t =30000, b t =3000 M =7 customer transaction item ( date 20110901) o 2-level clustered B+-tree on date o cost=2+3000*(10/30)=1002 a o output size=10000 tuples=1000 blocks o 2-level clustered B+-tree on custID o cost=10000*3=30000 b o output size=10000 tuples (the join attribute is a key for customer ) pipeline ( age 30 sex =’F’) o output size=10000*(30-18)/(70-18)*0.5 o =1154 tuples pipeline pipeline o 3-level clustered B+-tree on itemID o cost=1154*4=4616 c o output size=1154 tuples (the join attribute is a key for item ) ( name , itemName , price ) o output size=1154 tuples=116 d blocks materialize merge sort to eliminate duplicates o initial number of runs= 116/7 =17 o number of merge passes=2 o cost=116*(2*2+1)=580 e Total cost= a + b + c + d + e =36314 pipeline...
View Full Document
This note was uploaded on 01/11/2012 for the course CS CS4482 taught by Professor Drlee during the Winter '11 term at City University of Hong Kong.
- Winter '11