| From: | Sean Davis <sdavis2(at)mail(dot)nih(dot)gov> |
|---|---|
| To: | jzobel(at)heute-morgen(dot)de |
| Cc: | pgsql-general(at)postgresql(dot)org |
| Subject: | Re: Limits of SQL |
| Date: | 2005-06-02 20:04:10 |
| Message-ID: | 4cc4a1618669015e512eafdffc110c60@mail.nih.gov |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
A couple of links:
http://www.dbazine.com/ofinterest/oi-articles/celko24
http://www.dbmsmag.com/9603d06.html
On Jun 2, 2005, at 2:33 AM, Joachim Zobel wrote:
> Hi.
>
> I am looking for a way to write a SELECT that finds connectivity
> components of a graph or at least for one that given two nodes
> determines if there is a path between them. It seems that this is not
> possible, no matter what graph representation I choose. Which
> constructs
> from set theory are missing in SQL? Set of all subsets is one I am
> missing, or can it be done somehow?
>
> Is anybody else thinking about the limits of SQL? As often I am
> probably
> not the first to ask these questions. Any pointers?
>
> Sincerely,
> Joachim
>
>
>
> ---------------------------(end of
> broadcast)---------------------------
> TIP 6: Have you searched our list archives?
>
> http://archives.postgresql.org
>
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Marcelo | 2005-06-02 20:29:04 | adding columns with defaults is not implemented |
| Previous Message | Oleg Bartunov | 2005-06-02 19:49:03 | Re: Limits of SQL |