[Date Prev][Date Next]
Re: (ITS#7698) Multiple Paged search requests on one connection fail
- To: openldap-its@OpenLDAP.org
- Subject: Re: (ITS#7698) Multiple Paged search requests on one connection fail
- From: firstname.lastname@example.org
- Date: Tue, 17 Sep 2013 20:02:52 GMT
- Auto-submitted: auto-generated (OpenLDAP-ITS)
John Unsworth wrote:
>>> There are no other directory servers in existence that can scale to the
> level that OpenLDAP does and perform well at that scale.
> How do you justify/prove that statement?
Our (Symas) customers tell us which directory server they're migrating from
when they come to us. We perform benchmarks periodically as well. Nothing else
comes close. Come to LDAPCon this year, we'll be presenting our latest
benchmark results then.
> -----Original Message-----
> From: Howard Chu [mailto:email@example.com]
> Sent: 17 September 2013 20:52
> To: firstname.lastname@example.org; email@example.com
> Subject: Re: (ITS#7698) Multiple Paged search requests on one connection
> firstname.lastname@example.org wrote:
>> Products other than browsers use LDAP servers. Our product is a meta
>> directory that watches for changes on multiple data sources (LDAP,
>> Databases, SAP, ...) and reconciles any changes across the complete
>> set of sources according to data filtering and transformation rules.
>> However sometimes it is necessary to read the whole data set - for
>> example when a new data server is added, or when changes may have been
>> missed for any reason, or when an 'audit' type operation is required
>> to ensure that all data sources are consistent. LDAP servers we
>> connect to typically contain thousands if not millions of entries.
> OpenLDAP is regularly used in production by large telcos with billions of
> entries. There are no other directory servers in existence that can scale to
> the level that OpenLDAP does and perform well at that scale.
>> Reading the lot without paging -
>> although we can do it - is very inefficient both in terms of LDAP
>> resources and application resources.
> That's utter nonsense. The amount of data is the same no matter how many
> pieces you slice it into. It is *more* inefficient to slice it into multiple
>> The directory is read using multiple parallel paged searches across
>> different branches on a single connection. Every directory we have
>> used except OpenLDAP can manage this effectively.
>> In the case of OpenLDAP there is no LDAP changelog and so the only way
>> we have of discovering changes is to read the whole directory and
>> compare with what was read last time.
> So you're saying you're connecting to OpenLDAP servers from version 2.1 or
> older, from before syncrepl or the accesslog or changelog overlays existed.
>> -----Original Message-----
>> From: Michael Ströder [mailto:email@example.com]
>> Sent: 17 September 2013 20:20
>> To: firstname.lastname@example.org; email@example.com
>> Subject: Re: (ITS#7698) Multiple Paged search requests on one
>> connection fail
>> firstname.lastname@example.org wrote:
>>> I would also be interested to understand why " paged results is
>>> inherently flawed".
>> Although being the author of an interactive LDAP UI client I still
>> wonder why people want paged results (or tree browsing).
>> If you have so many results you should narrow the search criteria.
>> Browsing/paging is pretty inefficient working style.
>> Ciao, Michael.
-- Howard Chu
CTO, Symas Corp. http://www.symas.com
Director, Highland Sun http://highlandsun.com/hyc/
Chief Architect, OpenLDAP http://www.openldap.org/project/