42 karma · joined February 16, 2026
In SNKV, I’m taking almost the opposite direction: keeping B-tree / storage-layer ideas and removing the SQL layer entirely, to expose a minimal key-value interface.
Curious how you think about the tradeoff between simplifying the query layer vs the storage layer.
I'm working on SNKV, which explores a different approach: skipping the SQL layer entirely and focusing on a simple key-value interface.
It works closer to the storage layer (b-tree / WAL / pager concepts), aiming for a lightweight and minimal design, while supporting multi-process access.
Curious how you think about the tradeoff between SQL flexibility and a simpler KV interface.
How do you handle manifest consistency and updates—append-only or rewrite-heavy?
in which i am directly accessing b-tree layer and not consuming query layer.
for kv workloads it is much faster compare to sql.
and yeah you will get same benefits of sqlite storage engine.