@Cat@ponder.cat to Technology@lemmy.worldEnglish • 1 month 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-square50fedilinkarrow-up1380arrow-down119cross-posted to: technology@lemmy.zip
arrow-up1361arrow-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.org@Cat@ponder.cat to Technology@lemmy.worldEnglish • 1 month agomessage-square50fedilinkcross-posted to: technology@lemmy.zip
minus-square@deegeese@sopuli.xyzlinkfedilinkEnglish2•1 month agoIf you use a hash table, you search every time you retrieve an object. If you didn’t retrieve, why would you be storing the data in the first place?
minus-square@source_of_truth@lemmy.worldlinkfedilinkEnglish1•1 month agoI know that, but phrased that way it sort of sounds like they’re iterating over the entire thing.
If you use a hash table, you search every time you retrieve an object.
If you didn’t retrieve, why would you be storing the data in the first place?
I know that, but phrased that way it sort of sounds like they’re iterating over the entire thing.