[erlang-questions] B-trees

Benoit Chesneau <>
Thu Dec 8 16:19:43 CET 2016


well having support of lmdb is quite orthogonal to have a btree in stdlib.
At first lmdb is not really a btree anyway and also comes with its own
problems when it's about storing the data on disk.

I would love personally to have a memory B+Tree in erlang where you can set
a custom function to compare keys. B+Tree have some uses cases that
gb_btree can't replace imo.

- benoit

On Thu, Dec 8, 2016 at 3:54 PM Lars Hesel Christensen <>
wrote:

>
>
> On 12/08/2016 07:36 AM, Walter Weinmann wrote:
> > I had a quick look on emdb (https://github.com/alepharchives/emdb) which
> > is the Erlang wrapper of LMDB. I couldn't see a traversal operation. So
> > it seems to be difficult to do range scans.
>
> I just stumbled across this LMDB driver which looks like it has at least
> partial cursor support: https://github.com/zambal/elmdb
>
> Lars
>
> _______________________________________________
> erlang-questions mailing list
> 
> http://erlang.org/mailman/listinfo/erlang-questions
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20161208/a335c5e2/attachment.html>


More information about the erlang-questions mailing list