| From: | Chris <chris(at)bitmead(dot)com> |
|---|---|
| To: | Hannu Krosing <hannu(at)tm(dot)ee> |
| Cc: | "Ross J(dot) Reedstrom" <reedstrm(at)wallace(dot)ece(dot)rice(dot)edu>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, pgsql-hackers(at)postgreSQL(dot)org |
| Subject: | Re: [HACKERS] Solution for LIMIT cost estimation |
| Date: | 2000-02-13 12:32:50 |
| Message-ID: | 38A6A472.DC0305B3@bitmead.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Hannu Krosing wrote:
> If I understood it right, RECURSIVE UNION is a way to query a tree
> structured
> table, whith parent_id's in each child row.
>
> AFAIK even have it in the TODO list ;)
>
> The LIMIT there probably limits how many levels down the tree are
> queried.
Original postgres used to be able to do this. The syntax
"retrieve* from xxx" would keep executing (eg traversing a tree) until
complete. Might be worth checking the original sources when you come to
do this.
--
Chris Bitmead
mailto:chris(at)bitmead(dot)com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bruce Momjian | 2000-02-13 13:20:33 | Re: [HACKERS] Problems compiling latest CVS sources. |
| Previous Message | Chris | 2000-02-13 12:29:34 | Re: [HACKERS] libpq |