Cat@ponder.cat to Technology@lemmy.worldEnglish · 2 months 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-square48linkfedilinkarrow-up1361arrow-down119cross-posted to: technology@lemmy.ziphackernews@lemmy.bestiver.se
arrow-up1342arrow-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.worldEnglish · 2 months agomessage-square48linkfedilinkcross-posted to: technology@lemmy.ziphackernews@lemmy.bestiver.se
minus-squareFarceOfWilllinkfedilinkEnglisharrow-up1·2 months agoThe key (aha) feature seems to be that the new data structure returns a hint that can be used alongside the key on lookup to make it faster. So, useful but not applicable in the majority of cases as you really do literally just have the key. That’s from a quick skim there may be more to it
The key (aha) feature seems to be that the new data structure returns a hint that can be used alongside the key on lookup to make it faster.
So, useful but not applicable in the majority of cases as you really do literally just have the key.
That’s from a quick skim there may be more to it