skalyanasundaram wrote:
i have a architecture like
o=abcd
|
|-- ou=1234
| |
| |--cn=lookhere
|
|-- cn=service
.
...
ldapsearch -D cn=admin,o=abcd -b o=abcd -w pwd
"(&(cn=lookhere)(ou=1234))"
ldapsearch -D cn=admin,o=abcd -b o=abcd -w pwd
"(&(ou=1234)(cn=lookhere))"
does not show any "Bad filter" error but it does not show any result also
These aren't bad filters, but unless the cn=lookhere entry has the ou
explicitly defined with value 1234 (and its objectclass set permits ou),
the filter won't find it. Attributes and values in the distinguished
name are not automatically encoded into the entry.
so my case is that there is object inside many sub containers.
i want to minimize the search. I know only the basedn and two three
sorrounded container
of the looking object.. may be between o=abcd and cn=lookhere there are n
number of
containers....
so how do i find?
You have two basic options:
1. perform a separate search on each of the various bases
2. encode the criteria (ou) information in your target entries as
attribute values
If the only reason you split your entries into these subtrees was to
distinguish them in searches, you should probably redesign.
Jon Roberts
www.mentata.com
---
You are currently subscribed to [email protected] as: [EMAIL PROTECTED]
To unsubscribe send email to [EMAIL PROTECTED] with the word UNSUBSCRIBE as the
SUBJECT of the message.
