Re: [Boost-users] Backend of multi_index container

Subject: Re: [Boost-users] Backend of multi_index container
From: Joaqun M Lopez Munoz (joaquin.lopezmunoz_at_[hidden])
Date: 2016-06-23 02:22:42

Anaswara Nair <anaswara.nn <at> gmail.com> writes:
> 
> 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.? 

Each ordered index is associated with a corresponding red-black tree
(https://en.m.wikipedia.org/wiki/Red%E2%80%93black_tree ). 

> 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 datab”¸()=Ñ¡•É́¡…Ù”‰••¸­¹½Ý¸Ñ¼ÕÍ”	½½Íй5ձѥ%¹‘•à™½ÈÍ¥µ¥±…ȁÁÕÉÁ½Í•Ì°)‰ÕЁ¥ÐÉ•…±±ä‘•Á•¹‘́½¸Ñ¡”™Õ¹Ñ¥½¹…±¥Ñäå½Ô¹••°å½ÕȁÁ•É™½Éµ…¹”)É•Åեɕµ•¹Ñ́…¹Ñ¡”É•ÍÕ±Ñ́½˜å½ÕȁÁ•É™½Éµ…¹”Ñ•ÍÑ̸€())½…Å×µ¸43ÍÁ•è5׎è