performance of >= search filters

["Mark Whitehouse" <markwhitehouse@home.com>]

Hi,

I have an LDAP DB ~50,000 entries.  I have noticed that the performance of
search filters with >= and <= components is very slow.

   i.e.
      (&(a=x)(b=y)(c=z))
   will return almost immediatly when a,b,c are indexed

   but
     (&(a=x)(b>=y)(c=z))
   is very, very slow

Both queries return 0 entries so that should not be a factor.

Is there any way to improve the speed of >= and <= search filters?

I am using OpenLDAP 1.2.x.  Will 2.x help?  Will partitioning the namespace
help - at present it is pretty flat.

Thanks,
Mark