@[email protected] to [email protected]English • 3 months 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-square38fedilinkarrow-up1304arrow-down114cross-posted to: [email protected][email protected][email protected][email protected][email protected]
arrow-up1290arrow-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@[email protected] to [email protected]English • 3 months agomessage-square38fedilinkcross-posted to: [email protected][email protected][email protected][email protected][email protected]
minus-square@[email protected]linkfedilinkEnglish3•3 months agoJSON libraries are stupidly well optimized. There are binary encoding schemes that are faster and more compact, but its hard to beat JSON for text-based.
minus-squareTrailblazing Braille TaserlinkfedilinkEnglish3•3 months agoEveryone prepare for your minds to be blown: Parsing Gigabytes of JSON per Second (Geoff Langdale, Daniel Lemire) https://simdjson.org/
JSON libraries are stupidly well optimized. There are binary encoding schemes that are faster and more compact, but its hard to beat JSON for text-based.
Everyone prepare for your minds to be blown: