LDAP - SQL structure of db

[Flawless_koder]

I've just finished (finally!) setting up openLDAP
to work with a Postgres backend. I can tell you -
it took some work!

Now it's up, and i've used an example db schema - and tested it - i'd like to move on to a real schema - but can't find any diagrams / notes on how they should be set up.

I can ( and in the meanwhile probably will ) use the template of the way the example was structured - and
base my design off of that - but i was wandering if anyone else had done an sql ldap backend and had notes
on how best to structure it in terms of table relations, whether normalization should be used extensively (it is in the example) and how functions
should operate.

Thanks

Flawless

[EvilDoppler]

duh - you know nuffin!!!

hehehehe..sorry mate..can't help you there!!

oO{thought to at least give you a reply in here and get things going}

[MattR]

If you could attach the schema it would be useful. Although I guess it's a typical tree-type representation which is fairly simple:
node( name, left_child, right_child ) -- unless it is more than a binary tree

[Flawless_koder]

Actually it's gone a bit wierd.
It works fine - but it also forsakes the rules of LDAP

I'm not too sure why it's doing this... but i basically can go outside the scope of an objectClass by using a representation to the parent that i need.

It's all working fine under that scheme, for once!

thanks for you time though Matt


Flawless