Re: Modeling General Graphs in SQL
From: Marshall Spight <marshall.spight_at_gmail.com>
Date: 25 Dec 2005 10:08:47 -0800
Message-ID: <1135534127.679826.175680_at_g43g2000cwa.googlegroups.com>
> The minimum path query is the same as transitive closure, which is
> widely believed to be inexpresible by standard SQL.
Date: 25 Dec 2005 10:08:47 -0800
Message-ID: <1135534127.679826.175680_at_g43g2000cwa.googlegroups.com>
mikharakiri_nospaum_at_yahoo.com wrote:
>
> The minimum path query is the same as transitive closure, which is
> widely believed to be inexpresible by standard SQL.
I was under the impression that it was proven, rather than "widely believed." Am I mistaken? Is this one of those things that's not been proven one way or the other?
Marshall Received on Sun Dec 25 2005 - 19:08:47 CET