Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> c.d.o.misc -> Re: Ora 9.2 SQL: What's the fastest way to do this set operation...

Re: Ora 9.2 SQL: What's the fastest way to do this set operation...

From: hansF <fuzzy.greybeard_at_gmail.com>
Date: Mon, 01 May 2006 04:12:19 GMT
Message-Id: <pan.2006.05.01.04.13.34.15000@gmail.com>


On Sat, 29 Apr 2006 22:04:57 -0700, dean wrote:

> Imagine I have a database of 10,000 trains and their ordered list of
> (around 2 million) scheduled locations, keyed on those trains and an
> order number. I want to go from A to B and there are no direct trains.
> I need to find all the pairs of trains, one going through A and the
> other through B, that share AT LEAST ONE OTHER location in common, call
> it C.
>

I'd probably imagine upgrading to Oracle10g and using it's Spatial directed network capability and the routing engine. Received on Sun Apr 30 2006 - 23:12:19 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US