I am looking for solution (technique) that will allow me, while using
traditional B+ tree, to obtain key from value without creating
"reversed" table. Some overhead is acceptable but not "reversed"
table. Looping is also not an option.

Thank you

Hi Dimitry,

What do you mean with "reversed" table?

Traditionally, you recursively descend into the tree and then search
the leaf node with binary search (or other search algorithms). No
tables are "created".

Regards
Chris


On Jul 13, 11:58 am, Dimitry <dmytro.bablin... (AT) gmail (DOT) com> wrote: