| From: | Yeb Havinga <yebhavinga(at)gmail(dot)com> |
|---|---|
| To: | Achilleas Mantzios <achill(at)matrix(dot)gatewaynet(dot)com> |
| Cc: | pgsql-sql(at)postgresql(dot)org |
| Subject: | Re: Table Design for Hierarchical Data |
| Date: | 2010-04-07 20:33:07 |
| Message-ID: | 4BBCEC03.3050100@gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-sql |
Achilleas Mantzios wrote:
> Στις Wednesday 07 April 2010 11:06:44 ο/η Yeb Havinga έγραψε:
>
>> 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 root are depicted as
>>> parents[0] : immediate parent
>>> parents[1] : immediate parent of the above parent
>>>
>>>
>> What I have more than one parent?
>>
>
> Then it is no longer neither a tree, nor a hierarchical structure, but rather a graph.
> This a totally different problem.
>
My question was actually an attempt to point at the inability of what
you call the 'genealogical approach' database design to store
information of more than one parent.
regards,
Yeb Havinga
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Achilleas Mantzios | 2010-04-08 06:56:06 | Re: Table Design for Hierarchical Data |
| Previous Message | Lee Hachadoorian | 2010-04-07 18:27:37 | Re: Table Design for Hierarchical Data |