@[email protected] to [email protected]English • 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-square38fedilinkarrow-up1304arrow-down114cross-posted to: [email protected][email protected][email protected][email protected][email protected]
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.org@[email protected] to [email protected]English • 3 months agomessage-square38fedilinkcross-posted to: [email protected][email protected][email protected][email protected][email protected]
minus-square@[email protected]linkfedilinkEnglish1•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-square@[email protected]linkfedilinkEnglish1•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.