Our description of static hashing assumes that a large contiguous stretch of disk blocks can be allocated
Fantastic news! We've Found the answer you've been seeking!
Question:
Our description of static hashing assumes that a large contiguous stretch of disk blocks can be allocated to a static hash table. Suppose you can allocate only Ccontiguous blocks. Suggest how to implement the hash table, if it can be much larger than Cblocks. Access to a block should still be efficient.
Related Book For
Fundamentals of Database Systems
ISBN: 978-0136086208
6th edition
Authors: Ramez Elmasri, Shamkant Navathe
Posted Date: