A particular table in a relational database contains 100,000 rows, each of which requires 200 bytes of memory. A SELECT statement returns all rows in the table that satisfy an equality search on an attribute. Estimate the time in milliseconds to complete the query when each of the following indices on that attribute is used. Assume a Page size of 4K bytes or 4,000 bytes and a Page access time of D = 20ms.

a. No Index (Heap File of Data Records)

b. A Static Hash Index (with no overflow buckets/Pages). Assume the cost of applying the hash function is H, negligible.

c. A clustered - sparse, unintegrated B+ Tree Index Assume a Data Entry k* size of 100 bytes and assume 75% occupancy

Static Hashing Buckets Hash Computation