Optimizing access patterns for extendible hashing

added by DotNetKicks
11/18/2019 5:01:24 PM

221 Views

I'm continuing to explore the use of extendible hashing and I run into an interesting scenario. The whole point of using a hash table is to reduce the cost of lookups to O(1). When using persistent data structures, the usual cost that we care about is not the number of CPU instructions, but the number of disk accesses.


0 comments