@Cat@ponder.cat to Technology@lemmy.zipEnglish • 1 month 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-up166arrow-down11cross-posted to: technology@lemmy.world
arrow-up165arrow-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@Cat@ponder.cat to Technology@lemmy.zipEnglish • 1 month agomessage-square17fedilinkcross-posted to: technology@lemmy.world
minus-squareJackbyDevlinkfedilinkEnglish1•1 month agoI need to look more into this, I would’ve thought query time on hash tables was already constant.
minus-square@CookieOfFortune@lemmy.worldlinkfedilinkEnglish2•1 month 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.