[elephant-devel] Re: Derived Indicies

[Ian Eslick]

>
> The table is the closest thing to a btree structure in an sql
> database. For example cursor operations are done on table. That is the
> idea of using tables as btrees.

BDB maps multiple btrees onto a single large btree.  An Elephant btree  
key is a binary concatenation of btree-oid+key.  This presumes that a  
custom sorting function is available.  This is why Elephant btrees are  
'cheap'.