With a distribution using lexico algorithm, the Sun OpenDS Standard Edition proxy forwards requests to one of the partitions, based on the alphabetical value of the first RDN after the distribution base DN in the request. When you set up distribution with lexico algorithm in Sun OpenDS Standard Edition proxy, you split the data of your database into different partitions, based on an alphabetical value of the attribute of your choice. The Sun OpenDS Standard Edition proxy then forwards all client requests to the appropriate partition, using the same algorithm.
For example, you could split your data into two partitions based on the cn of the entries, as illustrated in Figure 4-8.
In this example, any requests for an entry with a cn starting with B such as Ben are sent to Partition 1, while requests for an entry with a cn from M–Y are sent to Partition 2.
Note - The upper boundary limit of a distribution algorithm is exclusive. This means that a search for cn= Zachary in the example above will indicate that no such entry is found. In order to include entries starting with Z in the search boundaries, then you should use the unlimited keyword. For example, cn=[M..unlimited[ will include all entries beyond M.
The following search will be successful:
$ ldapsearch -b "cn=Ben,ou=people,cn=example,cn=com" "objectclass=*"
The following search will also be successful, as cn=Ben is the first RDN.
$ ldapsearch -b "uid=1010,cn=Ben,ou=people,cn=example,cn=com" "objectclass=*"
However, the following searches will indicate that the entry does not exist (with result code 32):
$ ldapsearch -b "cn=Ben,o=admin,ou=people,cn=example,cn=com" "objectclass=*"
$ ldapsearch -b "cn=Zach,ou=people,cn=example,cn=com" "objectclass=*"
The following search cannot be determined by the distribution to which partition it belongs and will be broadcast:
$ ldapsearch -b "ou=people,cn=example,cn=com" "cn=*"