[Date Prev][Date Next]
[Chronological]
[Thread]
[Top]
Efficient Searching for Groups & its members
- To: openldap-technical@openldap.org
- Subject: Efficient Searching for Groups & its members
- From: sim123 <Sim3159@gmail.com>
- Date: Wed, 23 Mar 2011 16:52:31 -0700
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:sender:date:x-google-sender-auth :message-id:subject:from:to:content-type; bh=+xcN0xAx4ABuRwyoFbcdpXzc+YdEeWjNOjISxZE8ZMs=; b=JD2EIEtSzMHL6b/hZjcHTE7nbUFcmMEaFfB2RsaWHJHw4J8srK6Ky5pzqa4RK6Y9yS UnEPO9ZEVrT76EBTmu0R5FfgMo2fEu8hY+Lp4yxAkDqOoh+nJCch7Z2HQtw7Su88/eJp UPF+2q3c6bi012zLppyotDbgfdVCnUWhN2ZVk=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:sender:date:x-google-sender-auth:message-id:subject :from:to:content-type; b=jGBtHG4KFLC+jVJM9h7/kXPMgTE2zSpq841jLjCksL9tbujrxkbRfHvnIA4xqJgjdj XQ1+KB6e8Tsic2NPwP77AbL/Pkz9R+czRzyTaLgHZwAycI41RJ3d+UYDsHHX+8azWhGH ZffQy6voMuWdqgHN180H3Xh8D8+hAs7w6QWG0=
Hi All,
I am designing LDAP schema and the structure looks like :
--ROOT
---- ou = people
------- cn = john smith
---- ou = groups
------ ou = group1
-------- member:john smith
------ ou = group2
-------- member: john smith
I would like to find out what all groups john smith belongs to (I have full dn) and all the members of a group. I am wondering about the performance of such search, since one person can be part of multiple groups and there can be thousands of groups in the server. If its a relational database I can create a relationship table and put indexes in place. How can I get best performance with OpenLDAP? Or is there any other way I should design this?
Thanks for the help.