From: | "Marco Bizzarri" <marco(dot)bizzarri(at)gmail(dot)com> |
---|---|
To: | bedouglas(at)earthlink(dot)net |
Cc: | PgSQL-General <pgsql-general(at)postgresql(dot)org> |
Subject: | Re: logic/db question |
Date: | 2006-08-03 09:07:40 |
Message-ID: | 3f0d61c40608030207i29f98ddcve0d769e0a96246ba@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
If table reorganization is an option for you, you could consider using
integer ranges for describing parant/children relationships.
I have seen them in one of Joe Celko books:
In that way, you can find all the children with just one query.
Regards
Marco
On 8/2/06, bruce <bedouglas(at)earthlink(dot)net> wrote:
> hi...
>
> i have a tbl
> fooTBL
> name
> parentID
> ID
>
> so a name can have might have a parentID, as well as an ID. 'name's are
> associated with other 'name's via the parentID. in other words, if a name's
> parentID == a name's ID, name1 is the parent of name2.
>
> name parentID ID
> foo - 1
> cat 1 2
> dog 2 3
>
> my question, how can i come up with a sql query that will list all the
> children (and children's children...) of a top level item?
>
> i had done this awhile ago.. but can't recall how i did it..
>
> thanks
>
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 6: explain analyze is your friend
>
--
Marco Bizzarri
http://notenotturne.blogspot.com/
From | Date | Subject | |
---|---|---|---|
Next Message | Hakan Kocaman | 2006-08-03 09:08:23 | Re: Query performance |
Previous Message | Richard Huxton | 2006-08-03 09:00:04 | Re: Query performance |