Cat@ponder.cat to Technology@lemmy.worldEnglish · 3 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-square50linkfedilinkarrow-up1374arrow-down118cross-posted to: [email protected][email protected]
arrow-up1356arrow-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 · 3 months agomessage-square50linkfedilinkcross-posted to: [email protected][email protected]
minus-squaredeegeese@sopuli.xyzlinkfedilinkEnglisharrow-up2·3 months 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·3 months 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.