| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Hierachical structures - an overview
joe.celko_at_northface.edu (--CELKO--) wrote:
>>> I have an app I need a hierachical structure for. There seem to be
>3 ways of implementing this, as far as I can see: <<
>
>I have a whole book on "Trees & Hierarchy in SQL" in production now,
>which is due out in April 2004. There are several variations on these
>three basic methods.
>
>For example, Vadim T. has a modified Nested Sets model, the "Nested
>Intervals" that uses (a,b) pairs of integers to represent rational
>numbers so that you can do frequent insertions.
>
>I am obligated to defend the nested sets model, since I made it
>popular in SQL FOR SMARTIES.
In your opinion, what ultimately might be the best general solution to the problem - adjacency lists with recursive SQL? Materialized path and the overhead to maintain it? Or your nested sets, with wide intervals? Received on Mon Jan 05 2004 - 13:46:19 CST
![]() |
![]() |