Slow Novell LDAP

[Brian G. <bri...@au...>]

How do,

Just wondering if there is an LDAP explanation for this curious
little thing we have found.

Novell DS tree with about 20,000 students in one OU.

If you ref a entry with a full DN (cn=bobsmith,ou=students...... etc)
it takes 3-6 (or more) seconds to return their entry.

If you set the base OU to the students container, and set the filter
to the student CN, it comes back in 0-1 seconds.

Or am I strange in thinking a direct ref to a object should be faster
then a search :-) (Might be for DS, but im not sure)

Any ideas ?

Anyone have the same thing with different DS trees ?

Thanks

Brian Green



----
  Brian Green
  Information Technology Group, Systems Engineer
  Auckland University of Technology, Auckland, New Zealand
  Ph: 9179999 ext 8396, Fax: 64-9-9179901
  WWW: http://home.aut.ac.nz/~bgreen/
  Email: bri...@au...

The information in this E-Mail is confidential and may be legally 
privileged. It is intended solely for the addressee. Access to this 
E-mail by anyone else is unauthorised. If you are not the intended 
recipient, any disclosure, copying, distribution or any action taken

or omitted to be taken in reliance on it, is prohibited and may be 
unlawful. 
Any views expressed in this message are those of the sender and may 
not reflect the views of AUT.