A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Cat@ponder.cat · 12 days ago

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

deegeese@sopuli.xyz · 11 days ago

The article is discussing how to reduce the constant time factor which depends on the filling fraction, which is a speed-memory tradeoff when creating the hash table.

The innovation described allows for the use of fuller tables which are resized less frequently, or faster insertion/retrieval for the existing filling fraction.