Comment on A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

• lime@feddit.nu ⁨1⁩ ⁨week⁩ ago

  the biggest speedup would probably come from using proper schemas that can be efficiently parsed. but we’ve made our bed out of ad-hoc protocols.

  source

  • frezik@midwest.social ⁨1⁩ ⁨week⁩ ago

    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.

    source

    • 0x0@lemmy.dbzer0.com ⁨1⁩ ⁨week⁩ ago

      Everyone prepare for your minds to be blown:

      • Parsing Gigabytes of JSON per Second (Geoff Langdale, Daniel Lemire)
      • simdjson.org

      source
  • barsoap@lemm.ee ⁨1⁩ ⁨week⁩ ago

    And yet all that pales in comparison to using react (or whatever framework) over vanilla js. Enter McMaster-Carr.

    source

    • lime@feddit.nu ⁨1⁩ ⁨week⁩ ago

      yupyup, just send HTML over the wire. it’s fine.

      source