Distributing entries based on the first letter of their RDN (alpha_distribution).

The example uses as many databases as you like to contain the data. For example, if you create three databases for a single suffix, entries starting with the letters A-I go to database 0, entries starting with the letters J-R go to database 1, and entries starting with the letters S-Z go to database 2. If you create 26 databases, each database would receive the entries for one letter of the alphabet.

Distributing entries based on a simple hash algorithm (hash_distribution).

In this example, entries are randomly distributed using a hash algorithm on the RDN to compute the database to which the entry will be written.

Chaining entries to a read-write replica from a read-only replica (chaining_distribution).

Usually the directory returns a referral to clients making update requests to a read-only replica. This example uses a distribution function on a suffix that contains both a read-only database and a database link. When the read-only database receives an update request, it forwards the request using the database link to a read-write database. The database link needs to be configured to chain on update.

For information on configuring database links, refer to the Creating Directory Entries chapter in the Red Hat Directory Server Administration Guide.