Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

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


Comment on Re^2: Architectural question...

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2014-07-28 11:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (196 votes), past polls