Suppose we have 100,000 records to store, and each record takes up 50 bytes. We use a two-level index to
This problem has been solved!
Do you need an answer to a question different from the above? Ask your question!
Question:
Suppose we have 100,000 records to store, and each record takes up 50 bytes. We use a two-level index to index this database (first level index is sparse), and each index takes up 5 bytes. Suppose one block of storage is capable of storing 500 bytes.
Please answer
(1) how many indexes are there in each of the two index tables,
(2) how many blocks does each index table contain, and
(3) how many blocks we need to search to locate one record for each level index?
| How many indexes are there in the table? | How many blocks does each index table contain? | How many searches are performed on the index to search for one key? |
First level index |
|
|
|
Second level index |
|
|
|
Related Book For
Fundamentals Of Database Systems
ISBN: 9780133970777
7th Edition
Authors: Ramez Elmasri, Shamkant Navathe
View Solution
Create a free account to access the answer
Cannot find your solution?
Post a FREE question now and get an answer within minutes.
* Average response time.
Question Details
Chapter #
17
Section: Review Questions
Problem: 24
Posted Date: September 09, 2023 07:21:31