Exercise 1: Index Storage Overheads
Consider a relation with the following storage parameters:
- B = 8192, R = 128, r = 100000
- header in data pages: 256 bytes
- key is integer, data file is sorted on key
- index entries (keyVal,tupleID): 8 bytes
- header in index pages: 32 bytes
How many pages are needed to hold a dense index?
How many pages are needed to hold a sparse index?
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}