Dear OpenLDAP-Community,

is it possible to compute a rough estimate of the number of elements between two given keys for an LMDB database?

Currently, I scan the first 1000 keys and extrapolate the count based on the average distance of the keys.

Maybe it is also possible to use some information about the common b-tree pages that are shared by both keys?

We need this functionality for query optimization within RDF4J.

Thank you for your support and best regards,

Ken Wenzel