Question: A particular Table in a relational database contains 100,000 Data Records/rows, each of which Data Record/row requires 200 bytes. A SELECT statement returns all Data
A particular Table in a relational database contains 100,000 Data Records/rows, each of which Data Record/row requires 200 bytes. A SELECT statement returns all Data Records/rows in the Table that satisfy an equality search on an attribute.
Question: Estimate the time in milliseconds to complete the query when each of the following Indexes on that attribute is used. (Question is asking for query, not insert!)
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)
ANSWER:
B. A Static Hash Index (with no overflow buckets/Pages). Assume the cost of applying the hash function is H, negligible.

ANSWER:
C. A clustered - sparse, unintegrated B+ Tree Index. Assume a Data Entry k* size of 100 bytes and assume 75% occupancy.
ANSWER:
Static Hashing Buckets Hash Computation Static Hashing Buckets Hash Computation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
