If you need more high performant variants of that, you can partition the
node-id-space, read them in multiple threads and collect them in a concurrent
queue for deletion, using a thread pool with a suitable transaction size for
the parallel deletion.
I think it is also possible to read the stor
Hi Mattias,
Thank you for your response. I am currently working with the version you
pointed out. My bigger concern is the possible deprecation of this component in
future releases.
As I pointed out, there are use cases where the Lucene timeline is not an
appropriate choice, but the graph-base
Hi Niels,
I think you're right about the lucene-based timeline not being right
for millions of indices, not possible even! The old index component
isn't a part of the official release, but is supported and available
as neo4j-legacy-index from neo4j maven repository,
http://m2.neo4j.org/org/neo4j/n
Hi Dario,
Looking at that picture it is indeed clear that a number of threads are
waiting for something. What is not shown is the more important information
about *what* they are waiting for. I would love to get information like that
in order to investigate the cause of the performance problem you
Maybe slow, but easy and and working:
for (Node n : graphDb.getAllNodes()) {
if (!n.hasRelationship()) {
n.delete();
}
}
On 12.04.2011 20:19, Rick Bullotta wrote:
> Is there any recommended technique for scanning a Neo databa
Is there any recommended technique for scanning a Neo database for orphaned
nodes (e.g. nodes with no relationships)?
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
I appreciate the new indexing framework available, and noticed the addition of
a Timeline based on Lucene. I was wondering if this is seen as a replacement of
the original graph-based B-tree Timeline.
If that is the case, I will have serious problems with the software I am
developing, and whic
Hi, Dario.
I suspect we might be seeing some of the same issues, in an environment where
we are simultaneously writing a steady stream of data into neo while also
attempting to query it back out. The very nature of our graph design requires
that there be a few "mother nodes" for various collect
Hi all,
Due to huge performance issues with some of our neo queries I profiled my calls
on the neo server. The profiling shows, that up to 85% of the time the threads
are waiting for other threads. I don’t understand what’s going on there.
Hopefully someone with a deeper knowledge can help me.
Kevin,
we are right now working on QA on the release. Hope to get everything
through all the tests today and release ASAP after that. So, this
week. Can send you a link to the build file offlist.
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 10
Peter,
That sounds great. I'm happy to test it out. Send it over and I'll let you
know how it goes.
What's the target date for 1.3 release?
Kevin
On Tue, Apr 12, 2011 at 1:24 AM, Peter Neubauer <
peter.neuba...@neotechnology.com> wrote:
> Kevin,
> in the upcoming 1.3 Neo4j release, we change
Hi folks,
Marko and me spent some time today improving on the Gremlin scripting
plugin. Now you can at least return first results as collections of
nodes and relationships nicely formatted into the Neo4j REST syntax,
see https://github.com/peterneubauer/gremlin-translation-plugin . As
we move forwa
Brendan,
I think you are talking about the REST API ?
I added an option some time ago (but - my fault, messed up updating the docs) -
will fix that after our release.
You can also specify a fullPath suffix to the url that provides you with full
blown node an relationships in a path not just the
Or traverse paths and get exactly what you want from that.
nodes() is a wrapper around the paths iterator which returns Path#endNode()
relationships() is a wrapper around the paths iterator which returns
Path#lastRelationship()
2011/4/12 Matěj Plch :
> You can traverse only relatioships and call
2011/4/12 Jose Angel Inda Herrera :
> thanks michaels for your answer,
> Mattias i have a query, if I do EmbeddedGraphDbImpl G1 = G2;, means that if I
> delete information of the graph G1 is also deleted in G2, and if this is the
> best way to create a temporary graph
So, I think we're down on a
15 matches
Mail list logo
