MySQL Forums
Forum List  »  Performance

Re: Implementing distance matrix 2500 X 2500
Posted by: STARYNKEVITCH Basile
Date: December 14, 2004 08:25AM

Felix John wrote:
> Hi Basile,

I (Basile) am not a MySQL expert!

> We were thinking about a 2 dimensional array in conventional programming. All we wanted was to
> implement a database equivalent to the 2D array but efficiently.

RDBMS are designed to manage *efficiently* large *relations* (not arrays or functions or mappings). Of course you need to help them with suitable indexes. And of course, for storing a big matrix, any RDBMS is slower than the binary dump of the matrix in a binary file!

> What about an idea of splitting the 2500 column table into 2500 tables with one column each ? Can
> youu please tell the efficiency of such an implementation ?

I dont have time to do the testing for you. I suggest you to make a small test (in whatever scripting or programming language you like: Ocaml, PHP, C, C++, Java, CommonLisp, Perl, Ruby) and to measure by yourself. I will be delighted to read your results!

And I am not a MySQL expert (and if I where a MySQL consultant, I probably won't make the testing for free...).



Options: ReplyQuote

Written By
December 13, 2004 11:06AM
Re: Implementing distance matrix 2500 X 2500
December 14, 2004 08:25AM

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.