Read Latency (Indexed)
Lower is better. O(1) lookup time.
Write & Update Latency
Updates scale with file size (Rewrite). Ingest is batched.
Raw Benchmark Data
| Dataset | File Size | Ingest (Writes) | Ops/Sec | Indexed Read | Single Update |
|---|
🚀 Read Performance
Indexed reads are effectively instant (~0.07ms). The Hash Map implementation ensures that lookup time does not increase with dataset size. Perfect for high-traffic read operations.
⚠️ Update Trade-off
To guarantee ACID compliance in a single file, updates require rewriting the file. This scales linearly. For 1M records, an update takes ~6.3s. Use batching for heavy writes.
💾 Ingest Speed
The system handles burst writes efficiently. Ingesting 1M records individually took ~17s (~58k ops/sec), demonstrating robust queue management.