| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
 |
 | |||
| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
|
| |||
Home -> Community -> Usenet -> comp.databases.theory -> Re: XQuery question
In article <4b45d3ad.0305152208.3ea6e13d_at_posting.google.com>, neo55592
@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...
 |
 |