From: | "Merlin Moncure" <mmoncure(at)gmail(dot)com> |
---|---|
To: | "Tatsuo Ishii" <ishii(at)postgresql(dot)org> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: RFP: Recursive query in 8.4 |
Date: | 2008-02-22 19:53:16 |
Message-ID: | b42b73150802221153m8a95d30o1cfd5f4f6e6ac2f4@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Feb 19, 2008 at 3:36 AM, Tatsuo Ishii <ishii(at)postgresql(dot)org> wrote:
> We propose to implement the recursive query (WITH RECURSIVE clause)
> defined in SQL:1999 and later. With the recursive query, one can
> easily inquire the data expressed as tree and graph structures. The
> actual syntax we prefer is the one defined in SQL:2008 (it's not
> published yet, but I have a closest draft).
I am sure you are aware of various ad hoc approaches that are
currently possible. The recursive clause seems to generalize these
approaches.
Do you expect that your proposed solution will have performance
advantages over solutions like using recursive functions and (for tree
organized data) arrays?
merlin
From | Date | Subject | |
---|---|---|---|
Next Message | Oleg Bartunov | 2008-02-22 21:17:44 | Re: Full-text search default vs specified configuration |
Previous Message | Robert Lor | 2008-02-22 19:10:10 | Re: Proposed changes to DTrace probe implementation |