Cat@ponder.cat to Technology@lemmy.zipEnglish · 18 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-up157arrow-down11cross-posted to: [email protected]
arrow-up156arrow-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 · 18 hours agomessage-square16fedilinkcross-posted to: [email protected]
minus-squareNigelFrobisherlinkfedilinkEnglisharrow-up2·5 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.