Hi Paddy,
Just for your information, I've been running a lot of shortest path
operations on a graph of similar size to yours (approx 1 million Nodes & 5
Million Relationships).
I'm using an Amazon instance with 32GB of RAM, but am only using a heap size
of 8GB (as other people are sharing the same instance).
I choose the start and end Nodes randomly, so occasionally the AStar
algorithm actually exhausts the entire graph during a search.

What I've found is that the first 1-3 search operations may take up to a
minute in the worse case (when entire graph is exhausted) but after this I
never see run times of over 10 seconds (entire graph exhausted), and in most
cases it completes in between 0-4 seconds

Cheers,
Alex

On Mon, Jul 5, 2010 at 5:05 PM, Peter Neubauer <
[email protected]> wrote:

> Paddy,
> posting on the user list - yes, I think you should add RAM to hold
> your graph in memory, and then maybe write some routing to warm up the
> caches. That is, read all nodes up into RAM before you do the first
> search, or e.g. perform some interesting searches to load all
> interesting data.
>
> Would that be possible? What hardware config are you running on right now?
>
> Cheers,
>
> /peter neubauer
>
> COO and Sales, Neo Technology
>
> GTalk:      neubauer.peter
> Skype       peter.neubauer
> Phone       +46 704 106975
> LinkedIn   http://www.linkedin.com/in/neubauer
> Twitter      http://twitter.com/peterneubauer
>
> http://www.neo4j.org               - Your high performance graph database.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Sun, Jul 4, 2010 at 4:34 AM, Paddy <[email protected]> wrote:
> > hi peter,
> > Hope all is well, I have modeled the bus network with timetables and
> stops
> > connecting by walking distance.
> > There are approx 10 million and 1 million nodes. the graph is approx 1gb
> > Running on my local machine, to find the best route , it takes 5 seconds
> to
> > do approx 100 lucene query searches and add approx 100 relationships to
> the
> > graph
> > it can take from 3 - 10 seconds to find a shortest path , with the a star
> > algorithm.
> >
> > what steps could i take to speed up the app?  More RAM? Run in the cloud?
> > Thanks
> > Paddy
> >
> >
> >
> _______________________________________________
> Neo4j mailing list
> [email protected]
> https://lists.neo4j.org/mailman/listinfo/user
>
_______________________________________________
Neo4j mailing list
[email protected]
https://lists.neo4j.org/mailman/listinfo/user

Reply via email to