On Jul 14, 3:25 pm, Jonathan Leffler <jleff..._at_earthlink.net> wrote:
> Dimitry wrote:
> > 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.
>
> Homework?
>
> Generally, a B+Tree is an indexing structure that identifies a record.
> The record contains the key - and auxilliary data. So, you should be
> able to extract the key from the record, if you know the structure of
> the record. If you don't, you're on a hiding to nothing - there could
> be multiple keys that refer to the same data, in general, so there's no
> way to determine the key (nor, even, a key) from the value.
>
> --
> Jonathan Leffler #include <disclaimer.h>
> Email: jleff..._at_earthlink.net, jleff..._at_us.ibm.com
> Guardian of DBD::Informix v2007.0226 --http://dbi.perl.org/
What alternative would you suggest?
Received on Sun Jul 22 2007 - 07:06:08 CDT
