Cat to [email protected]English • 21 hours 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-square16fedilinkarrow-up161arrow-down11cross-posted to: technology[email protected]
arrow-up160arrow-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.orgCat to [email protected]English • 21 hours agomessage-square16fedilinkcross-posted to: technology[email protected]
minus-square@[email protected]linkfedilinkEnglish2•8 hours 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.