I’ve been experimenting with using SQLite as a key–value store without going through the SQL layer.

SQLite’s B-Tree implementation is extremely mature and well-tested, but most access goes through the SQL compiler, VDBE, and query planner. I wanted to see what happens if you bypass all of that and interact directly with the B-Tree APIs.

The result is a small prototype KV store that:

Uses SQLite’s internal B-Tree interfaces directly

Avoids parsing, planning, and VDBE execution

Keeps SQLite’s ACID guarantees intact

In local benchmarks with mixed read/write workloads, this approach showed noticeably lower overhead compared to equivalent SQL-based access patterns.

please let me know if you face any bug, let me know area of improvements that i can add in it.