Cat@ponder.cat to Technology@lemmy.zipEnglish · 17 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-up159arrow-down11cross-posted to: technology@lemmy.world
arrow-up158arrow-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@ponder.cat to Technology@lemmy.zipEnglish · 17 hours agomessage-square16fedilinkcross-posted to: technology@lemmy.world
minus-squareNigelFrobisher@aussie.zonelinkfedilinkEnglisharrow-up2·4 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.