From: Achilleas Mantzios <achill@matrix.gatewaynet.com>
Organization: Dynacom Tankers Mgmt
To: pgsql-sql@postgresql.org
Subject: Re: Table Design for Hierarchical Data
Date: Wed, 7 Apr 2010 10:39:41 +0200
User-Agent: KMail/1.9.7
References: <n2i5ab13581004061033j4ed25734xd0504cb95a1fc092@mail.gmail.com>
	<201004071000.15529.achill@matrix.gatewaynet.com>
	<4BBC3D14.8080401@gmail.com>
In-Reply-To: <4BBC3D14.8080401@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain;
  charset="utf-8"
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline
Message-Id: <201004071139.42140.achill@matrix.gatewaynet.com>

=CE=A3=CF=84=CE=B9=CF=82 Wednesday 07 April 2010 11:06:44 =CE=BF/=CE=B7 Yeb=
 Havinga =CE=AD=CE=B3=CF=81=CE=B1=CF=88=CE=B5:
> Achilleas Mantzios wrote:
> > You could also consider the genealogical approach, e.g.
> >
> >
> > The parents of any node to the root, i.e. the path of any node to the r=
oot are depicted as
> > parents[0] : immediate parent
> > parents[1] : immediate parent of the above parent
> >  =20
> What I have more than one parent?

Then it is no longer neither a tree, nor a hierarchical structure, but rath=
er a graph.
This a totally different problem.

>=20
> regards,
> Yeb Havinga
>=20
>=20


=2D-=20
Achilleas Mantzios