I'm in the process of designing and setting a new LDAP server for our university. We're designing the tree structure, but we have some dubts about it.
We want to store in the tree contact information for all the people that work and study at the university. People lie into three different categories: staff, academic staff (teachers and researcher) and students. Is not rare that a person belongs to two categories: a teacher is part of the staff or a student is also a teacher or research assistant. We want to enable access to certain resources based on user category, we also need that when you search for a person you can find it no matter which category he is . It doesn't make sense for dupplicating date in each category: Do we have a more elegant solution? We also have the problem that a perosn might have access to different systems, soit might have a collection of passwords. Here we are dealing with the idea of putting all the password in the same object or have objects hanging from the owner. In our coffee chat we were wondering if there is a more or less formal method for designing a LDAP directory like there is for relational databases. Any ideas welcome, sorry form poor english Andres --- 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.
