[Date Prev][Date Next]
Re: I want to create a good ldap tree
I am not sure exactly what you are asking here, but you could...
- Define three organizationalUnits: Employees, Customers, Suppliers.
- Create a unique uid for each employee, customer and supplier. uids need
not be tied to names, and could be numeric for suppliers and customers.
- Create an organizationalPerson entry for each employee, customer and
supplier. organizationalPerson requires sn and cn, so if you don't know a
particular person's sn, you're going to have to come up with something to
put in there (maybe "unknown").
- All other attributes are optional, so add them if you've got them.
DNs would be something like:
Just my suggestion, and there are probably people with more LDAP experience
who might suggest a better way.
> From: Tom <email@example.com>
> Organization: www.56k.fr.st
> Reply-To: tqueste <firstname.lastname@example.org>
> Date: Wed, 7 Feb 2001 11:02:36 +0100
> To: openldap-software@OpenLDAP.org
> Subject: I want to create a good ldap tree
> Hello all,
> I'm a french student and I must create a LDAP tree for an enterprise.
> So i will ask you some advises.
> I've got a problem with the identification of the persons.
> There are 3 categories :
> - employee
> - customer
> - supplier
> Each employee has got an uid (his login like "tqueste") and a password
> But the customers and the suppliers haven't got any of these
> attributes. All theirs attributes are:
> - surname/givenname (or common name ?)
> - postaladdress
> - phonenumber
> - phonenumber2
> - mobile
> - e-mail
> My question is : How can I identify a customer or a supplier ?
> Because :
>> A customer/supplier hasn't ever got a surname and a givenname
> - we could have :
> sn = smith
> givenname =
> - Or :
> sn =
> givenname = john
>> A customer/supplier has got a phonenumber OR phonenumber2 OR a
> e-mail OR a mobile. In fact, we don't know all the attributes :-(
> I must identify the customers and the suppliers because I must create
> add/modify/delete PHP pages for the LDAP tree.
> Thanks for all,