Hash tables are particularly efficient when the maximum number of entries can be predicted in advance so that the bucket array can be allocated once with the optimum size and never resized.

I want to have a very large hash table, i.e. so big it won't fit into memory. What's a good way to do that? I could use a database, but since it's only going to be key => value pairs that I am ...