(ITS#4531) hdb vs. search base

[donn@u.washington.edu]

Full_Name: Donn Cave
Version: 2.3.21
OS: Red Hat RHEL 3
URL: ftp://ftp.openldap.org/incoming/
Submission from: (NULL) (128.95.135.150)


subtree search finds or does not find entries, depending on search base depth.

Data is a medium large, departmentally structured university white pages
directory.  There are two main branches, students and staff.  The students
branch is fairly regular data, while the staff branch is user-entered garbage.

The problem is in the staff branch - search bases below the suffix, but above
the actual department containing the entry, do not work.  There are 6800
departments at this level.

So far, have not been able to duplicate with similar data, either synthetic or
significantly reduced.  No major variation on the data has created a similarly
broken directory, and no minor variation has fixed the problem.  I will keep you
all posted if I come up with anything, but for now all I can offer is
essentially the whole crummy thing, if you want it (sorry if I filled up your
incoming/ directory!)

The problem does not occur with bdb backend, only hdb.