How to store directory like structures?

From: Axel Straschil <axel(at)straschil(dot)com>
To: pgsql-sql(at)postgresql(dot)org
Subject: How to store directory like structures?
Date: 2005-04-03 10:13:48
Message-ID: slrnd4vghu.tp.axel@m2.sine
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Hello!

I want to store some structure like:

CREATE TABLE node
(
nodeid SERIAL PRIMARY KEY,
parent INT REFERENCES node(nodeid)
ON UPDATE CASCADE ON DELETE CASCADE,
label TEXT,
UNIQUE (parent, label),
...
data
...
);

The label is used to map a node to a directory like strukture, so i can
have a function directory_for(nodeid) which gives me
/root_label/parent_label/parent_label/my_label (root labels have NULL as parent)

The problem is the ammount of queries when i've got deep nodes, and I
often have to query if a node is "in path" of another node.

Is there a good solution to build directory-tree like datastruktures?
I found, http://www.sai.msu.su/~megera/postgres/gist/ltree/ which seems
to do what i want, but I've no idea (and probalbly no chance) to get
that running on my system ;-(

Thanks,
AXEL.

Responses

Browse pgsql-sql by date

  From Date Subject
Next Message Andrus Moor 2005-04-03 10:50:05 Re: Merging item codes using referential integrity
Previous Message Andreas Pflug 2005-04-03 09:20:08 Re: [SQL] delphi access question?