I have downloaded neo4-rest-graphdb, a rest wrapper for Java.
README file says this interface does not support transactions. So we have:
- EmbeddedGraphDatabase, which is good for tests, supports transactions
and has quick communications. Not good for medium sized or HA apps
because lacks
Hello Aniceto,
- EmbeddedGraphDatabase, which is good for tests, supports transactions
and has quick communications. Not good for medium sized or HA apps
because lacks separation between app and data
The EmbeddedGraphDatabase is fine for production use - in fact it's the default
choice!
2011/6/19 Jim Webber j...@neotechnology.com
Hello Aniceto,
- EmbeddedGraphDatabase, which is good for tests, supports transactions
and has quick communications. Not good for medium sized or HA apps
because lacks separation between app and data
The EmbeddedGraphDatabase is fine for
http://docs.neo4j.org/chunked/snapshot/rest-api-batch-ops.html
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
Fortunately, recent changes seem to have made the memory leaks I was
experiencing a few weeks ago to vanish. Apologies for not playing a more
active part in these discussions, but I'm finding there to be a quite
steep learning curve here, and I don't have the time to make a major
push to
According to the neo4j-sh help, there is a -c option to the trav command
that should allow for executing the ls command on each node visited in a
traversal.
-c Command to run for each returned node. Use $i for
node/relationship id, example:
-c ls -f name $i. Multiple commands can be
Hi Nolan,
I think I can answer a few of your questions. Firstly, some background. The
graph model of the OSM data is based largely on the XML formated OSM
documents, and there you will find 'nodes', 'ways', 'relations' and 'tags'
each as their own xml-tag, and as a consequence each will also have
Hello everyone, could you advice on the best way to do the following in neo4j?
Given:
- a graph G=V, E on which each node has an associated positive cost
- a subset of source nodes S in E.
I'd like to build a second graph in which each e in (S-E) is connected
to any one of the source nodes S via
On 6/19/2011 7:11 PM, Giacomo Bernardi wrote:
I'd like to build a second graph in which each e in (S-E) is connected
From what i understood, connecting S-E to an arbitary node A1 and S
with another arbitary node A2 and finding the lowest cost shortest path
between A1 and A2 should give you the
Hi Guys,
We currently thinking of how we can get type safety when we do queries, one
thing we do is have a category nodes, so e.g.
Here is a sample query
IEnumerableUser list =
g.v(0).outE[[label:'HOSTS']].inV[[Key:'MyCompanyName']].inE[[label:'IS_COMPANY']].inV
So the part highlighted
10 matches
Mail list logo