Cat@ponder.cat to Technology@lemmy.zipEnglish · 22 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-square17fedilinkarrow-up161arrow-down11cross-posted to: [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@ponder.cat to Technology@lemmy.zipEnglish · 22 hours agomessage-square17fedilinkcross-posted to: [email protected]
minus-squareNigelFrobisher@aussie.zonelinkfedilinkEnglisharrow-up2·9 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.