Hello,
the berkeley db is used for backend dbase for many ldap server.
I have read that the organization data in Berkely DB is made in btree,
hash recno ect. algorithms.
From source openldap I have view that the server open the berkely db
database using b-tree algorithm.
This parameter has effect on the ldap server performances?
Is the b-tree order factor static?
Is possible tuning this parameter?
Thanks in advance.
Giovanni.
---
You are currently subscribed to ldap@umich.edu as: [EMAIL PROTECTED]
To unsubscribe send email to [EMAIL PROTECTED] with the word UNSUBSCRIBE as the
SUBJECT of the message.
