Cascade Hash Tables A Series Of Multilevel Double Hashing Schemes With O(1) Worst Case Lookup Time | Awesome Learning to Hash Add your paper to Learning2Hash

Awesome Learning to Hash

A Webpage dedicated to the latest research on Hash Function Learning. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Cascade Hash Tables A Series Of Multilevel Double Hashing Schemes With O(1) Worst Case Lookup Time

Li Shaohua. Arxiv 2006

[Paper]    
ARXIV Independent

In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables. By this strategy, it could effectively reduce collisions in hash insertion. Thus it gains a constant worst case lookup time with a relatively high load factor(70%-85%) in random experiments. Different parameters of cascade hash tables are tested.

Similar Work