Re: newbie question: run time root and schema discovery? Paging?

[Julio Sánchez Fernández <j_sanchez@stl.es>]

Robert Mundkowsky wrote:

> By subtree search, you mean that you do a search for all objetcs
> of a objectclass  (i.e. cn=*) and then increase the search filter
> via "and"s (i.e. "(and cn=<one of the attr. found> sn=*)" <-- might
> have the syntax wrong, but I can fix it)?

Not really, I meant something doing the equivalent of:

	ldapsearch -s sub -b one-of-the-bases 'objectclass=*'

> Using "ldapsearch", I noted that size limits stop many of my
> searchs.

Oops, this is a valid point.  I had not thought of this.  Hard recursion
(using -s one and then repeating the process at each lower level) comes
to mind, but it is a mess and would not work in all cases.  Someone more
experienced would care to comment on this?

> I believe that LDAP v3 contains a paging mechanism, so I take it that
> "ldapsearch" does not use the paging mechanism?

Please take into account that OpenLDAP does not implement v3 yet, so none
of the pieces support that facility: not the servers, not the protocol,
not the clients.

Julio