+45
−0
Loading
Prompted by https://github.com/coderage-labs/spillway/issues/162, which attributed a 103 s query to this driver spilling a temp B-tree in Go. Running that workload here showed no spill (the LIMIT-bounded ephemeral b-tree path never touches a temp file) and a CPU cost of about 2x the same C build, the 103 s being unbounded overlap of periodic polls. The section records what was measured: CPU time per query on linux/amd64 against SQLite 3.53.4 compiled with our options, 2.0x/1.9x/1.3x with modernc.org/libc v1.75.7 and 3.0x/2.2x/1.6x with the transpiled musl mem* routines of earlier libc versions; that the ratios hold under concurrency; and the two practical consequences, indexing what ORDER BY/GROUP BY/WHERE use and bounding the database/sql pool. Co-Authored-By:Claude Fable 5.1 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01PmfDBCBKB4vdyiiG94dXK9