Undergraduate shows that searches within hash tables can be much faster

[Sandman]

I apologize to the forum members for posting something that I suspect Erel will find so interesting that he will lose a good part of his work day.

"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

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

www.quantamagazine.org

 

[cklester]

I expect my B4X hash tables (or Map?) to use this method now. Maybe in the next update?

Very cool article, though! What an accomplishment!