Hi Paul
My questions for the group are:
1) Are there any suggestions for how subgraphs might be algorithmically
determined? Are there clustering algorithms that might be leveraged?
What you describe brings to my mind the field of community detection
techniques, i.e. methods that
Mattias Persson wrote:
Another problem I see is that you're having too granular transactions
which will slow down the insertion process quite a bit. Try grouping a
couple of thousands operations in one transaction and you'll see a
performance boost!
FYI: I can trigger the problem you were
as well.
Thanks again for the prompt response!
2010/1/29 Mattias Persson matt...@neotechnology.com:
2010/1/29 Symeon (Akis) Papadopoulos papa...@iti.gr:
Mattias Persson wrote:
Another problem I see is that you're having too granular transactions
which will slow down
() is not exposed
from the LuceneIndexService, should I expect that it is handled internally?
The project I'm running is rather large, but at some point I will try to
prepare a script in order to replicate the error.
2010/1/26 Symeon (Akis) Papadopoulos papa...@iti.gr:
Hi all
Hi all
While populating a Neo graph, I got the attached exception
(org.apache.lucene.index.MergePolicy$MergeException. See file for
details: I replaced a local path with [some-local-path]).
My setup is like this: I want to benchmark Neo4j for some operations,
amongst which is graph loading.
and that we read in between the transaction commits?
2010/1/26 Symeon (Akis) Papadopoulos papa...@iti.gr:
Hi all
While populating a Neo graph, I got the attached exception
(org.apache.lucene.index.MergePolicy$MergeException. See file for details: I
replaced a local path with [some-local
Hi all
While processing a large Neo graph (in the order of 300k nodes - 2M
edges), the Java Virtual Machine crashed with the following message:
#
# An unexpected error has been detected by Java Runtime Environment:
#
# java.lang.OutOfMemoryError: requested 1024000 bytes for GrET in
, Jul 21, 2009 at 2:06 PM, Symeon (Akis) Papadopoulos
papa...@iti.grwrote:
Hi all
While processing a large Neo graph (in the order of 300k nodes - 2M
edges), the Java Virtual Machine crashed with the following message:
#
# An unexpected error has been detected by Java Runtime Environment
Hi all
I get the following exception when I attempt to shutdown a neo service
(under windows).
Exception in thread main
org.neo4j.impl.nioneo.store.StoreFailureException: Unable to close store
[local-path-on-my-pc]\neostore.relationshipstore.db
at
Was that what you meant?
My interpretation of Symeons request was an index from
(RelationshipType,Node,Node) to Relationship, which in my opinion would be
much more useful than a simple index from (String,primitive) to
Relationship, which is how the node indexes work.
That was exactly
AM, Symeon (Akis) Papadopoulos
papa...@iti.grwrote:
Perhaps the lookup method should have an additional argument specifying
whether the relationship is directed or not.
Good point, but I think it's better to add a specific method for that kind
of lookup:
interface
and the Model implementation. Is this the
recommended practice?
Thank you in advance.
Regards,
Symeon (Akis)
2009/6/24 Symeon (Akis) Papadopoulos papa...@iti.gr:
Hi all
I am a newbie to Neo4j, but as it seems very pertinent to my research
interests (web 2.0 mining), therefore I am planning
[My apologies for insisting on this issue.]
There's (at least) two solutions to this problem. One is that, as you
suggest, to have the iterator wrap its methods in transactions in
addition to the code that returns the iterator (look at
org.neo4j.util.TxIterator in neo-utils component). This
Hi all
I am a newbie to Neo4j, but as it seems very pertinent to my research
interests (web 2.0 mining), therefore I am planning to test it as an
infrastructure layer for massive graph analysis.
One very basic (even naive) question I have regards the separation
between transaction management
14 matches
Mail list logo
