Cat@ponder.cat to TechnologyEnglish · 24 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-up164arrow-down11cross-posted to: [email protected][email protected]
arrow-up163arrow-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 TechnologyEnglish · 24 hours agomessage-square17fedilinkcross-posted to: [email protected][email protected]
minus-squareJackbyDev@programming.devlinkfedilinkEnglisharrow-up1·12 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·5 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.