Cat to [email protected]English • 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-square16fedilinkarrow-up161arrow-down11cross-posted to: technology[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 to [email protected]English • 21 hours agomessage-square16fedilinkcross-posted to: technology[email protected]
minus-squareJackbyDevlinkfedilinkEnglish1•9 hours agoI need to look more into this, I would’ve thought query time on hash tables was already constant.
minus-square@CookieOfFortunelinkEnglish1•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.