Question: A relation ( R ) has 1 0 0 , 0 0 0 records. Each record size is 5 0 bytes. A data

A relation \( R \) has 100,000 records. Each record size is 50 bytes. A data block size is 4 KB (4096 bytes). Each block needs 96 bytes to store block header information. Records of R are stored on the hard disk in sequential file style (sorted on attribute A). The usage of each block is \(80\%\).
1. How many blocks are needed to store R?
2. A sparse index is created for attribute A. The index maintains one key entry for each data block. Each block can store 300 key entries. How many blocks dose the index need?
3. A dense index is create for attribute B. Each block can store 300 key entries. How many blocks dose the index need?
4. Assume attribute \( A \) and \( B \) have similar data distribution on \( R \). For the following two range searches
5.\(100
A relation \ ( R \ ) has 1 0 0 , 0 0 0 records.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!