mirror of
https://git.openldap.org/openldap/openldap.git
synced 2025-12-30 03:29:35 -05:00
Annuaire LDAP
* The original code performs ( n ) normalizations * and ( n * ( n - 1 ) / 2 ) matches, which hide * the same number of normalizations. The new code * performs the same number of normalizations ( n ) * and ( n * ( n - 1 ) / 2 ) mem compares, far less * expensive than an entire match, if a match is * equivalent to a normalization and a mem compare ... * * This is far more memory expensive than the previous, * but it can heavily improve performances when big * chunks of data are added (typical example is a group * with thousands of DN-syntax members; on my system: * for members of 5-RDN DNs, members orig bvmatch (dirty) new 1000 0m38.456s 0m0.553s 0m0.608s 2000 2m33.341s 0m0.851s 0m1.003s * Moreover, 100 groups with 10000 members each were * added in 37m27.933s (an analogous LDIF file was * loaded into Active Directory in 38m28.682s, BTW). * * Maybe we could switch to the new algorithm when * the number of values overcomes a given threshold? */ |
||
|---|---|---|
| build | ||
| clients | ||
| contrib | ||
| doc | ||
| include | ||
| libraries | ||
| servers | ||
| tests | ||
| acconfig.h | ||
| acinclude.m4 | ||
| aclocal.m4 | ||
| configure | ||
| configure.in | ||
| COPYRIGHT | ||
| INSTALL | ||
| LICENSE | ||
| Makefile.in | ||
| README | ||
OpenLDAP Devel README This software was obtained from the development branch (HEAD) of the OpenLDAP Software Repository. This copy is likely already not current, the development branch changes frequently. These changes include code implementing experimental features and unproven bug fixes. Please do NOT redistribute copies of the development branch. The OpenLDAP Developer's FAQ is available at: http://www.openldap.org/faq/index.cgi?file=4 Client developers seeking a suitable development platform should use "release" or "stable" versions. http://www.openldap.org/software/ --- $OpenLDAP$