Re: XQuery question

From: Kenneth Downs <MyUseNetHandle_at_linuxmail.org>
Date: Sun, 18 May 2003 19:53:06 -0400
Message-ID: <lq69ab.ibq.ln@mercury.downsfam.net>

Quoting unnamed sources, Neo claimed:

>> Could you easily solve graph problems in XML?
>> Find the shortest path in a graph, for example?

>
> What is the significance or benefit of solving "shortest path in a
> graph" and are rdbs well suited to solve such problems?

I don't have quite the command of terminology that some here have, but here is an example.

Given meta-data tables that describe relations between tables, and the names of two columns in any two tables, determine if a set of JOIN conditions can be constructed for a generated SELECT statement.

This is not quite "shortest" path problem, but it is an example from real life of using an RDMS to solve path problems.

-- 
Kenneth Downs

Received on Sun May 18 2003 - 18:53:06 CDT