Re: Modeling General Graphs in SQL

Bill Karwin wrote:
> Or you might need to assign weights to the edges, and
> return the minimum path between two vertices (wow, that would be a *cool*
> SQL expression that could do that!).

The minimum path query is the same as transitive closure, which is widely believed to be inexpresible by standard SQL. By "standard SQL" I've meant to exclude certain "non-cool" extensions like "connect by" and "recursive with" (even though the latter is formally a part of ANSI SQL). Received on Thu Dec 22 2005 - 04:17:54 CET