|
|
Posted by SomeDude on 09/08/05 01:35
Lo group,
During my quest for the "perfect" way for storing tree-structures it
quickly became clear that all of the available SQL-solutions have their
own peculiar weaknesses (scalability, slow querying, dangerous inserts,
etc).
This makes me wonder if storing a tree-structure in LDAP would be a
realistic alternative? Scaling probably wouldn't be a problem but how
about speed and stuff?
To make things clearer I am thinking about retrieving all
path-info for my webbased application (up to the leafs which can be
comments, posts, links or whatever) from the LDAP server and then loading
the related data from a database.
Any insights/experiences would be highly appreciated,
SomeDude.
Navigation:
[Reply to this message]
|