Cat@ponder.cat to Technology@lemmy.zipEnglish · 21 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-square17fedilinkarrow-up160arrow-down10cross-posted to: [email protected][email protected]
arrow-up160arrow-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.zipEnglish · 21 hours agomessage-square17fedilinkcross-posted to: [email protected][email protected]
minus-squareJackbyDevlinkfedilinkEnglisharrow-up1·9 hours agoI need to look more into this, I would’ve thought query time on hash tables was already constant.
minus-squareCookieOfFortune@lemmy.worldlinkfedilinkEnglisharrow-up2·2 hours agoOnly if there’s no collisions. With lots of collisions it’s far from constant.
I need to look more into this, I would’ve thought query time on hash tables was already constant.
Only if there’s no collisions. With lots of collisions it’s far from constant.