1. Consider a search with equality selection. For an unclustered hash index file organization, what is the cost if exactly one data record qualifies i. e the serarch is on a candidate key?

Assume B page, D cost per page, R data records per page , c cost per page record when the page is in memory, H cost for hash (assume no overflow pages) Hash index 80% occupancy (thus the number of pages is 1.25B) Data entries K* are 10% the size of data records.

Please answer this

2. A dense index is one that

a. is clustered

b has an entry for each value of the indexed attribute

c.. has an entry for each tuple

d. is on a secondary key