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-up1309arrow-down114cross-posted to: [email protected]
arrow-up1295arrow-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: [email protected]
minus-squarefrezik@midwest.sociallinkfedilinkEnglisharrow-up4·1 day agoDepends on the implementation, but most will, yes. There are other forms of associative arrays, like trie or binary tree, but hash is the most common.
Depends on the implementation, but most will, yes. There are other forms of associative arrays, like trie or binary tree, but hash is the most common.