While discussing some Lua on a server with 0gb.us, I've decided to make a little Binary Search Tree mod. It'll use native Lua, and hopefully will be slightly faster than file scans. First, I'll make a simple CRUD support(create, read, update, delete) with B-tree indices, and then I might start moving into spatial data(so important in Minetest), relational integrity, and more complex stuff. There will be a GitHub repo soon.
FAQ: Who is this mod for? Other modders to depend on if they want to store data.
Where can I download it? It is not finished yet.
Will it let me do everything [MYSQL/MSSQL/Postgre/Foo RDBMS] can do? Probably not, but the more important stuff will probably be implemented.
Is it thread-safe? Assuming Lua's stuff is safe with that(because multiple ABMs/etc might fire), especially the dictionary, queues will be safe with it.
What about performance? It's in Lua, so it's not the fastest, but disk access it limited by use of a small lookup cache.
What about data stability? It will flush every few seconds or so. Every write less than 4096 bytes should be atomic, depending on the OS.