Hi,

I would like to construct a BDB B-tree from a given large set of
key-data pairs. Inserting the pairs incrementally, one by one, is too
slow. Theoretically, the best way to do it is to sort the pairs and
construct B-tree bottom-up at once.

_Question_: does BDB support this way of (bulk) construction? which
methods should be called?


Best,
Roman

PS:
Another solution is to use an external sorter to presort the input and
insert the pairs in ascending order. This will result in near 100 %
cache hits, but is still slower than a bulk construction. This solution
is not good enough for me.