Do you have a question? Post it now! No Registration Necessary. Now with pictures!
- Posted on
- Using LDAP as an alternative for SQL trees
September 7, 2005, 10:35 pm
rate this thread
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,
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,
Re: Using LDAP as an alternative for SQL trees
With perfect I mean an alternative way for storing large trees using a
method that will outdo the following common methods:
- adjacency method (easy but query intensive)
- Materialized path
- Joe Celko Nested Sets (or MPTT which has slow updates)
- Tropashko's Nested Intervals with Continued Fractions (that does not
size well to both fat and high trees)