Polynomial-time insertion with logarithmic bucket size
Establish whether bucketized cuckoo hashing with bucket size \(b=\Theta(\log \epsilon^{-1})\) can support insertions taking polynomial time in \(\epsilon^{-1}\).
References
Within the study of bucketized cuckoo hashing, there are several goals that would be interesting to accomplish. (See, also, the discussion of bucketized cuckoo hashing in the related-work portion of the introduction.) Major questions include: Can one achieve $poly \epsilon{-1}$-time insertions with buckets of size $b = \Theta(\log \epsilon{-1})$?
There are several open problems and further research directions. On the practical side, the small final levels could be replaced by a more compact structure. More interestingly, PHastR bumps about ten times as many keys as the reaches force: it is open whether a search can approach this floor efficiently (which would save about $0.05$ bits per key), and whether bump-free placements, which would use just $S/\lambda$ bits per key, can be found efficiently within subsets of exactly known size, in spite of the long-range constraints that made simple backtracking fail in our prototype.