Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: Architectural question...

by devnul (Monk)
on Jul 07, 2005 at 22:43 UTC ( #473270=note: print w/replies, xml ) Need Help??

in reply to Re: Architectural question...
in thread Architectural question...

Dealing with heirarchal data is precisely what ltree was designed to do (using GiST indexes).

I do tend to agree that this is not ideally done in a relational database, which is the purpose of this post. I'm trying to find a different/better solution but so far am coming up empty. :(

- dEvNuL

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://473270]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2016-10-25 19:03 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (326 votes). Check out past polls.