Re: [Boost-users] Backend of multi_index container

Subject: Re: [Boost-users] Backend of multi_index container
From: Ernest Zaslavsky (ernest.zaslavsky_at_[hidden])
Date: 2016-06-23 01:02:53

IIRC it uses red-black tree
I had horrific experience with insert times, it just took too much time. Actually I had exactly your case, insert once and then just run on multiple indexes. Sounds like, if you don’t mind the load time, go for it.

From: Boost-users [mailto:boost-users-bounces_at_[hidden]] On Behalf Of Anaswara Nair
Sent: Wednesday, June 22, 2016 4:13 PM
To: boost-users_at_[hidden]
Subject: [Boost-users] Backend of multi_index container


Hi, I was going through the documentation of boost::multi_index container. I would like to know what is in its back end. Something like B-Tree,B+tree,etc.? Actually I want to create a database(in the sense it contains millions of records), but need not be reusable at a later period of time. i.e, I am looking only for run-time persistent data. Once data is inserted to this, it will not be modified. And there will be a unique id for each record. I would also like to know whether multi_index is the best suited one for the implementation of my so called database.. Thankyou