From: Achilleas Mantzios <achill@matrix.gatewaynet.com>
Organization: Dynacom Tankers Mgmt
To: pgsql-sql@postgresql.org
Subject: Re: We all are looped on Internet: request + transport
	=?utf-8?q?=3D=09invariant?=
Date: Fri, 20 Apr 2007 16:14:43 +0300
User-Agent: KMail/1.9.3
References: <14110647859.20070413105812@narod.ru>
	<1177072978.760.40.camel@pampa> <4628B6FD.1030209@archonet.com>
In-Reply-To: <4628B6FD.1030209@archonet.com>
MIME-Version: 1.0
Content-Type: text/plain;
  charset="utf-8"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
Message-Id: <200704201614.44007.achill@matrix.gatewaynet.com>

Just some thoughts on the matter:

Dmitry, you should acknowledge the fact that in databses you have two kinds of 
hierarchies:
a) The hierarchy denoted by the referential constraints between tables which 
constitute a Directed Graph (DG), with tables as nodes and FKeys as arrows.
b) Hierarchies applying to data, e.g.
create table ppl (
id serial PRIMARY KEY,
name text not null,
parentid integer REFERENCES ppl(id)
); (with GOD himself having parentid = null :).

I think that the second type is of interest at the application level.
(For system applications however, such as DB mirroring the first type of table 
hierarchy is important as well).

Speaking of postgresql there is a fine package by the GiST/tsearch creators,
contrib/ltree whose main task is to provide the primitives 
(functions/operators) for tree manipulation.

Dont know if i am irrelevant in this thread, but i hope i helped a little bit.

-- 
Achilleas Mantzios