The comparison between the classes of "Las Vegas" and "Monte Carlo" algorithms is a useful distinction, along with the author's suggestion of using a cache table as a lookup table for compression match finding.
If anyone is interested, I wrote @ronomon/hash-table as a fast, scalable cuckoo hash table for Node.js.
It has high load factor, constant lookup time in the worst-case and uses a non-recursive variant of the cuckoo probing scheme, together with a bloom filter to reduce cache misses to the alternative cuckoo bucket by an order of magnitude.
Last but not least, caching is supported according to the CLOCK LRU algorithm, which is elegant and effective.
Benchmarks and design decisions are in the README:
If anyone is interested, I wrote @ronomon/hash-table as a fast, scalable cuckoo hash table for Node.js.
It has high load factor, constant lookup time in the worst-case and uses a non-recursive variant of the cuckoo probing scheme, together with a bloom filter to reduce cache misses to the alternative cuckoo bucket by an order of magnitude.
Last but not least, caching is supported according to the CLOCK LRU algorithm, which is elegant and effective.
Benchmarks and design decisions are in the README:
https://github.com/ronomon/hash-table