MySQL Forums
Forum List  »  Performance

Re: Implementing distance matrix 2500 X 2500
Posted by: Felix John
Date: December 14, 2004 02:11AM

You have not answered to all of my questions so if u dont mind, Can u please take a look at this once more and answer all my doubts ?

According to you the table might look something like this having 6250000 rows ( 2500 * 2500 ),

x Y Distance
------------------------

1 1 0Km

1 2 1km

1 3 3km
. .
. .
. .
1 2500 5km
--------------------

2 1 4km
2 2 3km
. .
. .
. .
2 2500 5km

-------------------------

likewise it goes on until 2500.

1) Will a query like find all y where x == 1 and Distance == 3 scan all the 6250000 rows ?????.

2) Is it efficient to split this (2500 * 2500 = 6250000 rows) table into 2500 seperate tables of 2500 rows each ?????.

3) What do you think on an idea like this,


A table with 2500 columns and 2500 rows exactly like a distance matrix.

1 2 3 4 .... 2500
-------------------------------------------

1 1km 3km 2km 5km 1km

2 7km 1km 5km 8km 5km

3 1km 4km 6km . .

. . . . . .
.%

Options: ReplyQuote


Subject
Views
Written By
Posted
4858
December 13, 2004 11:06AM
Re: Implementing distance matrix 2500 X 2500
2359
December 14, 2004 02:11AM


Sorry, you can't reply to this topic. It has been closed.

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.