[morelisp]

No, use an LSM.

[pclmulqdq]

LSM trees are mostly for persistent storage. You can do a lot better in memory with a btree or a different data structure. LSM trees have a lot of operations that need multiple scans or are O(n) instead of O(log n).

[pxeger1]

LSM: https://en.wikipedia.org/wiki/Log-structured_merge-tree

[ww520]

Judy Arrays would be faster than LSM.

[lelanthran]

> No, use an LSM.

What is an LSM?