MVRB-Tree vs PHTree

[OGAWA Hirofumi]

Elifarley Callado Coelho Cruz <elifarley at gmail.com> writes:

> Hi,
>
> I wonder if you guys see any possible benefit of using MVRB-Tree
> instead of PHTree as a data structure for Tux3. It's used in the
> OrientDB NoSQL database.
>
> From https://github.com/orientechnologies/orientdb:
>
> "Furthermore it uses its own MVRB-Tree algorithm as a mix of Red-Black
> Tree and B+Tree. MVRB-Tree consumes about half memory of the Red-Black
> Tree implementation maintaining the original speed while it balances
> the tree on insertion/update. Furthermore the MVRB-Tree allows fast
> retrieving and storing of nodes in persistent way."

Hm, I'm still not sure about the detail of MVRB-Tree though. MVRB-Tree
seems to be deprecated by OrientDB since v1.6.

http://www.orientechnologies.com/docs/last/orientdb.wiki/Indexes.html

Thanks.
-- 
OGAWA Hirofumi <hirofumi at mail.parknet.co.jp>