Cool,
let us know how things work out with the full dataset!
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:
my new ssd (Intel X25-V, 40GB, 114€) is finally installed.
i continue my collatz number crunching from 90 millions to 100 millions.
Result : i'm cpu-bound again (1 core at 100%)
when the base was small enough to fit in ram it took ~10s to compute a
block of 10k.
now the db is ~22Go and it took mor
i ordered a SSD Intel X25-V (114€)
According to http://www.anandtech.com/storage/showdoc.aspx?i=3773 it's
a very good one, considering the very low price (for a SSD).
Not the best (of course), but still faster than my HDD Velociraptor 10krpm.
40GB (~30GB formated) should be enough for all my perso
i will try and benchmark :)
--
Ker2x
On Tue, Mar 23, 2010 at 11:09 AM, Craig Taverner wrote:
> Why not use a graph based index? Properly structured it should provide fast
> reads all the time (property structured kind-of means you have the most
> likely reads in cache, which is dependant on the
Why not use a graph based index? Properly structured it should provide fast
reads all the time (property structured kind-of means you have the most
likely reads in cache, which is dependant on the type of data).
On Tue, Mar 23, 2010 at 10:56 AM, Peter Neubauer
wrote:
> Awh,
> kinda not very fast
Awh,
kinda not very fast inserting then. From looking at the code, this
kinda sux for fast inserting since you need to go in and out of
indexes. Not sure how to speed that up. Could you keep some of the
index in memory maybe?
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neu
nope.
"The LuceneIndexBatchInserter is designed for being performant when
inserting large amounts of data with minimal lookups from the index
during that time."
problem : i do a lot of lookup while inserting :)
--
Ker2x
On Tue, Mar 23, 2010 at 10:43 AM, Peter Neubauer
wrote:
> Laurent,
> have
Laurent,
have you looked at the BatchInserter for doing big initial
populations? It is MUCH faster than the normal Neo4j transactional
approach, see http://wiki.neo4j.org/content/Indexing_with_BatchInserter
Would that help?
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neub
On Fri, Mar 19, 2010 at 10:20 AM, Laurent Laborde wrote:
> thank you peter.
> Following the various link, i found http://www.cytoscape.org/
> Look very promising !! i'll try this weekend :)
3 days later, i'm still populating neo4j like a crazy, trying to
compute the collatz conjecture up to 100 m
thank you peter.
Following the various link, i found http://www.cytoscape.org/
Look very promising !! i'll try this weekend :)
--
Laurent "ker2x" Laborde
Sysadmin & DBA at http://www.over-blog.com/
___
Neo mailing list
User@lists.neo4j.org
https://lists
Very cool!
A fast search gave me this thread:
http://groups.google.com/group/view-theinfo/browse_thread/thread/731b82b961fd557a
that might have some hints.
Otherwise, we have collected a few options on
http://wiki.neo4j.org/content/Visualization_options_for_graphs, feel
free to add - specially Ub
i quickly hacked an app to populate the neo4j database with the
collatz conjecture graph.
here it is http://github.com/ker2x/Collatz4Neo/blob/master/collatz4neo.java
and the code is ugly, but it just works(c)(r)(tm)
now the problem is to find a way to graph millions of nodes. :/
something like thi
Still,
very cool, and processing rocks!
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
i totally forgot to say that it's jsut a proof of concept, this small
app don't use neo4j
--
Ker2x
On Tue, Mar 16, 2010 at 12:19 AM, Laurent Laborde wrote:
> i used processing : http://www.processing.org/
> + the traer physic lib : http://www.cs.princeton.edu/~traer/physics/
>
> --
> Ker2x
>
>
i used processing : http://www.processing.org/
+ the traer physic lib : http://www.cs.princeton.edu/~traer/physics/
--
Ker2x
On Tue, Mar 16, 2010 at 12:14 AM, Mattias Persson
wrote:
> Cool :) What library do you use to visualize the graph?
>
> 2010/3/16 Laurent Laborde :
>> On Mon, Mar 15, 201
Cool :) What library do you use to visualize the graph?
2010/3/16 Laurent Laborde :
> On Mon, Mar 15, 2010 at 12:13 AM, Laurent Laborde wrote:
>> thanks to xkcd, it just made me notice that exploring the collatz
>> conjecture is just exploring a huge graph.
>> http://xkcd.com/710/
>>
>> If i have
On Mon, Mar 15, 2010 at 12:13 AM, Laurent Laborde wrote:
> thanks to xkcd, it just made me notice that exploring the collatz
> conjecture is just exploring a huge graph.
> http://xkcd.com/710/
>
> If i have some spare-spare-spare-spare time, i'll try that. (and draw the
> graph)
i built a small
thanks to xkcd, it just made me notice that exploring the collatz
conjecture is just exploring a huge graph.
http://xkcd.com/710/
If i have some spare-spare-spare-spare time, i'll try that. (and draw the graph)
--
Laurent "ker2x" Laborde
Sysadmin & DBA at http://www.over-blog.com/
__
18 matches
Mail list logo
