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 · 2 years 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.

frezik@midwest.social · 2 years ago

Depends on the implementation, but most will, yes. There are other forms of associative arrays, like trie or binary tree, but hash is the most common.

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