@[email protected] to [email protected]English • 3 months agoA 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.orgexternal-linkmessage-square17fedilinkarrow-up166arrow-down11cross-posted to: [email protected][email protected][email protected][email protected][email protected]
arrow-up165arrow-down1external-linkA 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@[email protected] to [email protected]English • 3 months agomessage-square17fedilinkcross-posted to: [email protected][email protected][email protected][email protected][email protected]
minus-square@[email protected]linkfedilinkEnglish3•3 months agoAll we have to do is rename b-trees to “hash tables” and database lookup times will be changed forever.
All we have to do is rename b-trees to “hash tables” and database lookup times will be changed forever.