[Date Prev][Date Next] [Chronological] [Thread] [Top]

Re: slow search when out-of-scope entries match (ITS#2897)

h.b.furuseth@usit.uio.no wrote:
> Full_Name: Hallvard B Furuseth
> Version: 2.1.25
> OS: Linux
> URL: 
> Submission from: (NULL) (
> Submitted by: hallvard
> With LDBM, a search for (objectclass=organization) in a big subtree
> which contains no matching entries, takes a long time if there is
> _another_ big subtree whose entries match.
> A search for an objectclass which does not exist in the database
> takes no time.
> Objectclass has an 'eq' index.
> When I try with a database with 50000 entires in scope without
> 'objectclass: organization' and 50000 entries out of scope with
> 'objectclass: organization', the 'slapd -d -1' output contains:

I suspect you-re hitting the ALLIDS threshold.
However, I agree the scope should matter ...


Dr. Pierangelo Masarati         mailto:pierangelo.masarati@sys-net.it
LDAP Architect, SysNet s.n.c.   http://www.sys-net.it

                      Buon Natale e felice Anno Nuovo                         
    SysNet - via Dossi,8 27100 Pavia Tel: +390382573859 Fax: +390382476497