Is there a muti index container for the harddisk storage rather than memory?

Question

I need a muti index container based on red-black trees (something like boost::multi_index::multi_index_container) for the case of the harddisk storage. All data must be store on hard disk rather than in memory.

Is there an open source container such that described conditions hold?

Note. I use C++.

Answer 1

If you have an in-memory solution, you can use a memory-mapped file and a custom allocator to achieve persistent storage.

Answer 2

I am afraid I don't know any.

For hard-disk storage I can only recommend a look to STXXL, which proposes STL containers and algorithms adapted to data that can only fit on disk. They have implemented many things to allow for a smoother manipulation, essentially by caching in memory as much as possible and delaying disk access when possible.

Now that won't get you a multi index, but at least you'll have a STL :)

Then, if you are determined, you can port multi-index to use the facilities provided by STXXL: they have decorrelated the IO access / memory caching from the containers themselves.

Or you can simply write what you need based on their STL-compliant containers.