Hello,

I wish to access the n-th entry in a database(say btree structure) in
an efficient way, but I can't find a clue that it is possible in bdb.
That would need to introduce a "number of nodes in its subtree or left
subtree" field to each node. I wonder if bdb support this. Thank you.

BTW if bdb does not support it, could anyone give a suggestion about
what i can do to achieve it?

Thanks and regards,

Kevin

klzhao (AT) gmail (DOT) com wrote:
BDB supports logical record numbers for the btree, queue, and recno
access methods. Details can be found at:
http://www.sleepycat.com/docs/ref/am_conf/logrec.html


Philip Guenther