Hi,
You started up the batch inserter on a store that had not been
shutdown properly. You could try startup in normal non batch inserter
mode and just shutdown:
new EmbeddedGraphDatabase( storeDir ).shutdown();
That will do a fast rebuild of the id generators and after that the
batch
It's possible that I haven't looked to hard, but my question is this:
A typical scenario for a site is to create a user. Before you create a user,
you do this in a transaction:
- begin transaction
- check if such a user (node in neo4j) exists
- if it exists, end transaction
-
Hi Dmitrii,
Separate threads can create nodes in different transactions, yes. You could
lock around the user creation code you included in order to keep user
creation atomic.
David
On Fri, Jul 16, 2010 at 10:59 AM, Dmitrii Dimandt dmitr...@gmail.comwrote:
It's possible that I haven't looked
Thank you for clarification!
Hi Dmitrii,
Separate threads can create nodes in different transactions, yes. You could
lock around the user creation code you included in order to keep user
creation atomic.
David
On Fri, Jul 16, 2010 at 10:59 AM, Dmitrii Dimandt
Hi,
I'm trying out neo4j for a while and want to see what happens if i write
concurrent to a node.
this is my test-case:
public void foo() throws InterruptedException {
final GraphDatabaseService db = ds.getGdb();
final CountDownLatch available = new CountDownLatch(2);
Hello,
Is there a high-performance way to search/lookup users within the relationships
of a given user? This is assuming that the relevant properties have been
indexed.
Thanks,
Peter
___
Neo4j mailing list
User@lists.neo4j.org
Hi Stefan,
Just off the top of my head, I don't think there is a solution for this. The
questions is, is it a problem? You have a first transaction that changes a
property, and then a second transaction comes along and changes the same
property. What behavior would you expect here? Couldn't your
Hi Peter,
There is no out-of-the-box sharding support right now. However, please see
http://wiki.neo4j.org/content/External_Articles for a couple of links
related to sharding.
David
On Wed, Jul 7, 2010 at 11:20 PM, Peter Soung pe...@sproutsocial.com wrote:
Are there any updates about sharding
Hi Peter,
Just to understand the issue at hand, what does your graph look like? What
problem do you want to solve? Do you have User nodes connected with some
type of relationship, and want to find all users connected to a given user,
who e.g. have an age property with a value greater than 30?
2010/7/16, Amir Hossein Jadidinejad amir.jad...@yahoo.com:
OK.
I think it's better if we have an InMemoryEmbeddedGraphDatabase, derive
from
EmbeddedGraphDatabase that load the whole graph in memory. It seems that
the
current interface is not appropriate for all applications.
yep, an
Dear all,
I want to use the graph-matching component in the following way:
a) user creates a subgraph via html form
b) the ids of all matching subgraphs are retrieved via the graph-matching
component in neo4j
c) the ids are used to do some stuff in the web application (a wild mixture of
Perl
That seemed to help get past that step. However, I am now seeing different
error(s) when I try to create a relationship between two nodes
Position[39993] requested for operation is high id[39992] or store is
flagged as dirty[true]
Hi
I didn't get a chance to finish re-factoring the project today, i will have
it ready Tuesday as I'd like to write some documentation as well and make
the code cleaner
Thanks
Paddy
On Thu, Jul 15, 2010 at 11:38 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Paddy,
great, we
13 matches
Mail list logo
