Re: XQuery question

From: Paul Tiseo <tiseo123.paul123_at_mayo.edu>
Date: Fri, 16 May 2003 13:55:02 GMT
Message-ID: <MPG.192eb7cf1f3e3c9a989687_at_news.easynews.com>

In article <4b45d3ad.0305152208.3ea6e13d_at_posting.google.com>, neo55592 _at_hotmail.com says...
> > 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"

        There are a million-and-one uses. I suggest you Google on Djikstra or Floyd-Warshall algorithms. Undoubtedly, you can come across pages that explain the algorithms and how they may be applied. Common student examples are network routing, the Travelling Salesman problem, scheduling, etc...

> and are rdbs well suited to solve such problems?

        Define "well-suited"? Performance? Maintainability? Data integrity? Ease of use? What is "well-suited" to you might not be "wellsuited"  to others...

---

Paul Tiseo, Systems Programmer
Research Computing Facility
Mayo Clinic Jacksonville, Griffin 371
tiseo123.paul456_at_mayo.edu
(remove numbers for proper address) Received on Fri May 16 2003 - 15:55:02 CEST