Re: Table Design for Hierarchical Data
От | Yeb Havinga |
---|---|
Тема | Re: Table Design for Hierarchical Data |
Дата | |
Msg-id | 4BBCEC03.3050100@gmail.com обсуждение исходный текст |
Ответ на | Re: Table Design for Hierarchical Data (Achilleas Mantzios <achill@matrix.gatewaynet.com>) |
Ответы |
Re: Table Design for Hierarchical Data
|
Список | 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
В списке pgsql-sql по дате отправления: