Cat@ponder.cat to Technology@lemmy.worldEnglish · 1 day 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-square39fedilinkarrow-up1304arrow-down114cross-posted to: hackernews
arrow-up1290arrow-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 · 1 day agomessage-square39fedilinkcross-posted to: hackernews
minus-squaredeegeese@sopuli.xyzlinkfedilinkEnglisharrow-up1·17 hours 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-squaresource_of_truth@lemmy.worldlinkfedilinkEnglisharrow-up1·13 hours 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.