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 · 1 day 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 · 16 hours ago

Hash tables are used in literally everything and they always need to minimize resizing because it’s a very expensive operation.

I suspect this will silently trickle into lots of things once it gets picked up by standard Python and JavaScript platforms, but that will take years.

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

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

Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine