Crowdly
Add to Chrome
We have built a partitioned hash index with 5 bits on a table S(A,B,C). Suppos...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
We have built a partitioned hash index with 5 bits on a table S(A,B,C). Suppose the first three (left-most) bits are for attribute A and the last two (right-most) bits are for attribute B. How many primary buckets will be searched to find records in S with B=25?
0%
0%
0%
0%