Maybe the answer is to create ou’s for the beginning characters and assign them accordingly then have the the system programmatically set the base when searching? But it’s searching on an attribute an not a DN. This is a short term solution that doesn’t much flexibility though.
From: Bradley T Gill bgill@aep.com Sent: Tuesday, April 11, 2023 3:58 PM To: Christopher Paul chris.paul@rexconsulting.net; openldap-technical@openldap.org Subject: [EXTERNAL] RE: Slow Search?
Thanks Chris, But does that mean that I am to expect a 6. 6 second search time for 3. 2M entries. While that seems like a large number, I think LDAP should handle it faster than that. That isn’t usable. I am hoping I am missing a tuning parameter
Thanks Chris, But does that mean that I am to expect a 6.6 second search time for 3.2M entries. While that seems like a large number, I think LDAP should handle it faster than that. That isn’t usable. I am hoping I am missing a tuning parameter somewhere.
Brad
From: Christopher Paul <chris.paul@rexconsulting.netmailto:chris.paul@rexconsulting.net> Sent: Tuesday, April 11, 2023 3:51 PM To: openldap-technical@openldap.orgmailto:openldap-technical@openldap.org; Bradley T Gill <bgill@aep.commailto:bgill@aep.com> Subject: [EXTERNAL] RE: Slow Search?
of 1 attribute with a scope of 1 and a base of that flat ou is taking 6. 2 seconds. Is that to be expected? Hey Brad, I have found that the response time on a flat branch relates directly and proportionally to nentries in that branch. And
of 1 attribute with a scope of 1 and a base of that flat ou is taking 6.2 seconds. Is that to be expected?
Hey Brad,
I have found that the response time on a flat branch relates directly and proportionally to nentries in that branch. And I am sure that this is the case with other vendor LDAPs, too, FWIW (inc AD and Azure-DS).
Chris