Hi Folks,I'm slowly but surely climbing the learning path in the neo4j world.
I'm using Dijkstra's algorithm for the shortest path calculation between two
nodes which now seems to be working fine after some code rearranging, however
I'd also like to get the list of available paths between two
Am using the V1.2 (stable)
Will try your suggestion.
Thanks for the prompt response!
Date: Fri, 4 Feb 2011 01:59:21 +0100
From: Michael Hunger
Subject: Re: [Neo4j] Stability of neo4j graph database
To: Neo4j user discussions
Message-ID:
Content-Type: text/plain; charset=us-ascii
Hello John,
Hello John,
what version of Neo4j are you currently running?
As it tries to replay an AddRelationshipCommand and there was a recent fix
around this issue, you might try to recover your db using
Neo4j version 1.3 (Abisko Lampa) M01.
(http://blog.neo4j.org/2011/01/neo4j-13-abisko-lampa-m01-ha-gro
Hello,
We have been evaluating the neo4j for one of our critical applications.
When the server goes down abruptly without the clean shutdown of the graph
db, it looks like the recovery always fails.
It consistently throws the exception given below and then the graph db
becomes unusable.
I dont thi
Andreas' rain man style subtraction skills to the rescue :) Glad it worked
out.
Happy hacking!
David
On Thu, Feb 3, 2011 at 12:16 PM, Raghava Mutharaju <
m.vijayaragh...@gmail.com> wrote:
> Hi David & Andreas,
>
> Aah, I deleted the contents of the db and ran it, this time I got the
> expected
We're actually using the logical logs already for backups now, I'll let you
know if we get this kind of problem again..
How can we use these logs to go back to a known good state, are there any
tools, and is it documented somewhere?
As for your questions..
- in this test we didn't delete nodes
Hi David & Andreas,
Aah, I deleted the contents of the db and ran it, this time I got the
expected result of 413 nodes. I was running the same program which creates &
traverses the graph multiple times, so the inconsistent results. Silly of
me :)
Thank you for pointing it out.
Regard
Hi Raghava,
Also, are you sure you're only creating the nodes once? Looking at your
numbers, (7434-7021=413) happens to be true, though the other intervals don't
match. Is this from a single run starting with a clean database (the db
directory is empty)?
-Andreas
On Feb 3, 2011, at 7:51 PM,
Hi Raghava,
Could you please provide the code used to create the store? Could you also
please provide the code you use to iterate all nodes?
The reference node always has id 0, so you can filter by ID to ensure that
you don't process that node.
David
On Thu, Feb 3, 2011 at 10:41 AM, Raghava Mut
Hi all,
I want to iterate over all the nodes in the graph and then do a tranversal
on each of them. To do this, I used the getAllNodes() method of
GraphDatabaseService class. But the number of nodes I get always varies on
each run. I checked the number of nodes I created during graph creation time
I've been able to manually put the store into a consistent state. I did this
by simply skipping the references to Relationship[2055394] that had somehow
gotten into the relationship chain of Node[1]. I haven't, however, been able
to reproduce or find the cause of this.
It would have been interesti
2011/2/3 Massimo Lusetti
> On Thu, Feb 3, 2011 at 2:01 PM, Peter Neubauer
> wrote:
>
> > Massimo,
> > I yesterday just tried to import the Germany OpenStreetMap dataset
> > into Neo4j using Lucene indexing. There are around 60M nodes that all
> > are indexed into Lucene, and then looked up when
On Thu, Feb 3, 2011 at 2:01 PM, Peter Neubauer
wrote:
> Massimo,
> I yesterday just tried to import the Germany OpenStreetMap dataset
> into Neo4j using Lucene indexing. There are around 60M nodes that all
> are indexed into Lucene, and then looked up when the Ways, consisting
> of a number of no
Hi Peter,
Thanks for your response. That helped me a lot.
I have to appreciate this community for being so prompt and helpful.
Thanks,
Vaibhav
On Tue, Feb 1, 2011 at 7:15 PM, Peter Neubauer <
peter.neuba...@neotechnology.com> wrote:
> Vaibhav,
> youi can use the new combined Evaluator to cont
Massimo,
I yesterday just tried to import the Germany OpenStreetMap dataset
into Neo4j using Lucene indexing. There are around 60M nodes that all
are indexed into Lucene, and then looked up when the Ways, consisting
of a number of nodes each, are calculated. Lucene is not fast, but it
works on thes
Hello everybody,
this is my first post here, so any kind of advice, tip , trick , link or
question will be nicely accepted.
I'm a linux system administrator on a reserch foundation, some of the
social media coworkers are interested on neo4j software and its
potential. So they asked me to insta
Hi!
Just make sure to confirm your email address with the wiki, and it will
happily accept you edits after that!
/anders
2011-02-03 13:10, Luanne Misquitta skrev:
> It asked me to log in- at the time I did not really notice the Create
> account link at the top right, so I assumed wiki editing w
It asked me to log in- at the time I did not really notice the Create
account link at the top right, so I assumed wiki editing was reserved
for certain people only.
I shall contribute directly the next time :-)
-Luanne M.
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-
I can comment also, that while it is possible to store properties as a
sub-graph as Tim suggests, that would be inefficient (in disk space and
performance). Neo4j stores properties in a special property store, not
actually within each node or relationship, but directly retrievable from the
node or
It's a wiki, why didn't you just do it yourself?
This is actually a general question to everyone on the list:
What is the main hurdle preventing you from contributing to the wiki?
Cheers,
Tobias
On Thu, Feb 3, 2011 at 11:04 AM, Luanne Misquitta wrote:
> Hi,
>
>
>
> Would be good to include Arbo
On Thu, Feb 3, 2011 at 11:30 AM, Mattias Persson
wrote:
> Lucene lookup performance degrades the bigger the index gets. That may be a
> reason.
I don't think Lucene cannot handle an index with 6/7 million of
entries. Maybe are some logs around?
Cheers
--
Massimo
http://meridio.blogspot.com
___
2011/2/3 Massimo Lusetti
> On Wed, Feb 2, 2011 at 1:20 PM, Tobias Ivarsson
> wrote:
>
> > You are doing I/O bound work. More then two threads is most likely just
> > going to add overhead and make things slower!
>
> I'm certainly doing something wired cause the performance of my tests
> aren't l
On Wed, Feb 2, 2011 at 1:20 PM, Tobias Ivarsson
wrote:
> You are doing I/O bound work. More then two threads is most likely just
> going to add overhead and make things slower!
I'm certainly doing something wired cause the performance of my tests
aren't linear.
I've run the app and let it proce
Done.
Feel free to let us know if you happen to anything generic up!
Cheers,
/peter neubauer
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
Hi,
Would be good to include Arbor.js (http://arborjs.org/) to the
JavaScript options listed in the Neo4J wiki
(http://wiki.neo4j.org/content/Visualization_options_for_graphs)
Have just started playing with it and it renders very nice graphs indeed
(HTML5 + JavaScript).
Regards
Luanne M.
Maximilian,
for the time being, you can always write a fast Server Plugin to do
this for you, should not be much work, see
http://components.neo4j.org/neo4j-examples/snapshot/server-plugins.html
where you can expose the fulltext queries.
Would that help?
Cheers,
/peter neubauer
GTalk: neub
Server did not exist for Neo4j 1.1, it was first released with 1.2.
Cheers,
Tobias
On Thu, Feb 3, 2011 at 12:57 AM, James Thornton wrote:
> Thank you. Is the the neo4j 1.1 server download still available?
>
> On Mon, Jan 31, 2011 at 8:59 PM, James Thornton
> wrote:
> > Since the current python
27 matches
Mail list logo
