Cat@ponder.cat to Technology@lemmy.worldEnglish · 13 days 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-square49fedilinkarrow-up11arrow-down10
arrow-up11arrow-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 · 13 days agomessage-square49fedilink
minus-squaredeegeese@sopuli.xyzlinkfedilinkEnglisharrow-up0·13 days 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?
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?