Suppose we want to create a linear hash file with a file load factor of 0.7 and a blocking factor of 20 records per bucket, which is to contain 112,000 records initially.
(a) How many buckets should we allocate in primary areas?
(b) What should be the number of bits used for bucket addresses?
(a) No. of buckets in primary area.
= 112000/(20*0.7) = 8000.
(b) K: the number of bits used for bucket addresses
2K < = 8000 < = 2 k+1
2 12 = 4096
2 13 = 8192
K = 12
Boundary Value = 8000 - 2 12
= 8000 - 4096
= 3904 -
You might also like to view...
Desk-checking is also called pencil-tracing, because the programmer uses a pencil and paper to follow each of the algorithm's instructions.
Answer the following statement true (T) or false (F)
A C++ predefined functions
a) are usually provided in libraries b) make C++ harder than necessary. c) must #include the proper header file d) are usually provided with the C++ compiler
The maximum length of a data field is indicated by its ________
Fill in the blank(s) with correct word
Which of the following increases proper airflow in a datacenter?
A. Humidity controls B. Video monitoring C. Temperature controls D. Hot and cold aisles