Cat@ponder.catdeleted by creator to Technology@lemmy.zipEnglish · 1 year 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-square17linkfedilinkarrow-up163arrow-down11cross-posted to: technology@lemmy.worldhackernews@lemmy.bestiver.se
arrow-up162arrow-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.catdeleted by creator to Technology@lemmy.zipEnglish · 1 year agomessage-square17linkfedilinkcross-posted to: technology@lemmy.worldhackernews@lemmy.bestiver.se
minus-squareNigelFrobisher@aussie.zonelinkfedilinkEnglisharrow-up2·1 year 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.