i need to read a table with over 2GB in size, and then find the shortest-path based on the read data. what is the best way to handle such a huge data ?
i need to read a table with over 2GB in size, and then find the shortest-path based on the read data. what is the best way to handle such a huge data ?
I think you're going to need to be more specific if you want a meaningful answer to this question.
What do you mean by shortest path? What is the algorithm you will be using to find it?
i think i'm gonna go with dijkstra algorithm, and from what i know they expect over 100 calls / second so it has to be quite advanced
the only problem i see is how to handle the data, which has a tendency to change.. say.. twice a day.
I can also say that the data is in MySQL - if its any help
Last edited by re-; 05-26-2007 at 02:41 PM.
