feel VS grenad

Continuing work on my compiler for the Decision Model and Notation FEEL Language. See https://github.com/paulchernoch/feel for the code if you are curious.

https://github.com/paulchernoch/feel

I tried new inserting algorithms on the sorter to reduce the amount of time spent sorting but didn’t find anything better than that, would you have any idea? I gave up trying better inserting algorithms by declaring that doing one final in-memory sort was more effective that doing a lot of comparison to try inserting keys in the right order…

I have finalized the latest release of grenad which introduce a lookup struct called a Cursor. Grenad is a library that provides tools to sort, merge, write, and read immutable key-value pairs.

I worked on my grenad library: a library used to sort, merge, write, and read key-value pairs, used in MeiliSearch for the new indexing system. I added a lot of documentation to the crate and done a lot of improvement by reducing the amount of copied memory when merging key-value pairs.

I was wondering if you could maybe point me to any blog post regarding the segment merging? I am using my grenad library, which is a simplification of my MTBL Rust port. This is a key-value store with some useful sorter helping functions, using a merge function, some compression parameters... Works great but could maybe be improved.

I also wanted to develop an immutable key-value store with some interesting properties like compression and multi-database (like for LMDB), it is much easier to develop than LMDB, I just need to base this on something like my grenad lib plus a wrapper to support multi-databases.