Key-value demo: cache speed, on disk, no hop
A key to 64-byte-container GET is a seqlock read off the RAM-ring, fanned across every core, with the data durable on disk underneath. No separate in-memory store, no network round-trip. Total time, measured live.
the in-memory key-value leader
A HOP, AND A LOSS WINDOW. It is a separate server, so every GET crosses the network, and between fsyncs a crash drops the last writes (RDB or AOF is a persistence tax, not a guarantee).
semurg, one engine
cache-speed GETs, zero loss window. The compute runs on the data, so there is no hop, and every key is durable on disk the instant it lands.
Fast like a cache, durable like a database, one copy of the data.
Stanford SNAP web-Google, 875K keys as 64-byte containers. Measured live on this box. Download it and re-run it yourself.
ask the agent to GET, the live throughput renders here
Total round-trip time, no asterisk. A networked cache pays a hop on every GET because it is a separate server; here the compute runs on the data, so there is no hop. And every key is durable on disk and survives a power loss with no persistence tax. Fast like a cache, durable like a database, in the one engine that also serves graph, full-text and vectors.