Cat to TechnologyEnglish • 20 hours 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-up1302arrow-down114cross-posted to: [email protected][email protected]
arrow-up1288arrow-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 to TechnologyEnglish • 20 hours agomessage-square39fedilinkcross-posted to: [email protected][email protected]
minus-square@[email protected]linkfedilinkEnglish1•11 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-square@source_of_truthlinkEnglish1•6 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.