[oscargrouch]

By looking into your code, it looks your Btree is a in memory implementation, correct?

I guess is a important information to put on the Readme, and also if you have any plans to create a persistent one, how you will approach this (if you will try to replicate the SQLite Btree here)

Also, i guess the most easy way to make a pesistent btree happen, is to get that one from that neat key-value store in Go that mimic the LMDB Btree (I dont recall the name right now).

The algo behind the LMDB kind dont need to use journal files, so will be reliable AND fast (is it inspired by Rodeh's Btrees ?). I just dont know about the paging aspect, if its any good as the one SQLite uses.

[evolveyourmind]

I’ve also noticed that. As far as I can tell, there isn’t actually any persistent operation, even for the tables.