Hi All,<div><br></div><div>I am designing LDAP schema and the structure looks like :</div><div><br></div><div>--ROOT</div><div>---- ou = people</div><div>------- cn = john smith</div><div>---- ou = groups <br clear="all">------ ou = group1</div>
<div>-------- member:john smith</div><div>------ ou = group2</div><div>-------- member: john smith</div><div><br></div><div>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? </div>
<div><br></div><div>Thanks for the help.</div>