RE: LDAP schema propagation to the backend

["Joao Abrantes" <jabra@mail.telepac.pt>]

	I think the penalty in performance is so big we should consider defining a
core syntax and matching rule set (a set that all backends support) and then
defining extensions to this set per backend.
	This way we could optimize queries because the backend has knowledge of the
core set. This is actually done in other LDAP servers (Netscape per
example... which defines a core set and then can be extended via a plugin).

	what do you think?

	Joao Abrantes

-----Original Message-----
From: owner-openldap-devel@OpenLDAP.org
[mailto:owner-openldap-devel@OpenLDAP.org]On Behalf Of Kurt D. Zeilenga
Sent: sábado, 29 de Janeiro de 2000 0:05
To: Mitya Kovalev
Cc: jabra@mail.telepac.pt; OpenLDAP Development
Subject: Re: LDAP schema propagation to the backend


At 02:14 AM 1/29/00 +0300, Mitya Kovalev wrote:
>Currently I avoid messing with syntax and matching rules by converting
filter to
>most relaxed corresponding SQL (that is, CIS matching) to get "candidates",
then
>testing them against full filter with test_filter()...

But watch out... CIS may not behave exactly like caseIgnoreMatch.
caseIgnoreMatch does more than just case ignoring (it also ignores
"extra" spaces).  To be able to use the SQL matching, it must
be more relaxed than the LDAP matching rule.