Need in-memory search-tree

[Wes James]

On Thu, Jan 24, 2013 at 3:43 PM, Kevin O'Gorman <kogorman at gmail.com> wrote:

> I'm programming a tool in C that needs to keep a really fast database
> in memory.  The most likely candidates are red-black or AVL trees.
> Deletion need not be supported, so long as the whole thing can be
> discarded to reclaim the memory. I could write it, but I'd rather not.
>
> Does anybody have a recommendation for a library that could help me
> with this?  Or failing that, a better place to ask?
>
> --
> Kevin O'Gorman
>

This isn't a C one, but you might be interested in looking at an erlang
based database called mnesia that has database functionality that work in
ram/disk or both:

http://www.erlang.org/doc/man/mnesia.html

wes
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.ubuntu.com/archives/ubuntu-users/attachments/20130124/eef2752c/attachment.html>