Perhaps then it is sensible to introduce a second layer of nodes, so that you
split down your "supernodes" and distribute the write contention?
Would be interesting if putting a round robin on that second level of color
nodes would be enough to spread lock contention?
This is what peter talks a
http://www.cs.usfca.edu/~galles/visualization/Algorithms.html
Nicely done, runs in the browser, perhaps useful for explaining stuff to people.
Cheers
Michael
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Please don't confuse a graph data structure with a "visual" graphical
representation, graphical can mean anything.
Graphs are nodes and relationships to other nodes which all can have
relationships.
For you as a Java developer it is perhaps easiest to imagine those as object
networks.
Otherwi
Dima,
do you have from your current data a distribution curve of friends per user ?
That determines the # of relationships per graph. E.g. when each user has about
50 friends (unidirectional) in average, that makes 100 billion relationships in
the graph.
So, not the # of nodes is the limiting
A minor optimization idea? Would it be sensible to use the shortstring storage
optimization for the rel-types (an perhaps node-types at some point) as well?
So if it fits within the 64 bits of a long it can be stored as such?
A more rigorous thing would be to restrict types to those criteria tha
Relationship-Types are already stored separately and just referenced via an ID,
so renaming them should be something the Neo4j store should offer.
Cheers
Michael
Am 05.05.2011 um 19:46 schrieb Rick Bullotta:
> Example: Today I call them "cars", but tomorrow I simply want to call them
> "depre
Nils that sounds interesting do you share the type mapping code for scala
somewhere?
Michael
Sent from my iBrick4
Am 05.05.2011 um 22:22 schrieb Niels Hoogeveen :
>
> I agree it can be valuable to assign a type to a node. In my own work I do
> that, but we may have very different needs with
Sorry meant Niels of course ;)
Sent from my iBrick4
Am 05.05.2011 um 22:35 schrieb Michael Hunger
:
> Nils that sounds interesting do you share the type mapping code for scala
> somewhere?
>
> Michael
>
> Sent from my iBrick4
>
>
> Am 05.05.2011 um 22
'll
> check those out.
>
> Re: HA and backups. Since we are a startup, unfortunately we have no $$$... :)
> Is it not possible to do backups in the open source version? I guess the
> database might need to be shutdown for that?
>
> Absolutely feel free to forward this
Hi Kobla,
Thanks Andreas for pointing that out. (here is a link to the guide book:
http://bit.ly/sdg-book or http://bit.ly/sdg-html)
Spring Data Graph is also able to talk mapped objects via REST to a server, but
I don't recommend it.
The wrapped Neo4j-API is far too fine grained and chatty to
And yes, you can easily build your db with millions of nodes that way.
Just try it for yourself.
Important is to choose a batch size for transactions that is not too small.
E.g. commit each 1 nodes.
To speed it up further you may disable caching for only the import.
Code sample below, it in
Sure, but you didn't ask for that.
You can try it for yourself. 1mio Nodes with 2 props each pull up the time to
10 sec on my machine. Adding one relationship between any two nodes (i.e. 1 mio
rels) adds another 10 sec.
That makes 20 sec for 1mio nodes, 1 mio relationships and 2 million propert
John,
as the exception says and Marko said before you can only have one embedded
graph db instance.
Accessing the db from the outside needs a protocol that allows the client to
talk to the db.
Either you go with the Neo4j-Server and use the provided graph-algorithms or
write your own Server P
No problem at all. As tx are bound to the executing thread. And the singleton
graph-db instance is the way to go.
Good Luck with your efforts
Michael
Am 11.05.2011 um 17:04 schrieb John Doran:
> Thanks Micheal,
> Good points, I have 3 weeks to finish up(along with a mountain of other
> things
So declare the node "a" before the transaction block.
Or (as you would otherwise too). provide a means to access a from the graph
either by linking it to the reference node and navigating from there or by
indexing it and retrieving it from the index.
Cheers
Michael
Am 11.05.2011 um 20:35 schr
Asseem,
the problem with that is that the last-modified since would have to be kept in
the graph store as well.
So ETag (i.e. hashing the target seems more sensible). Question is what to
include in that hash, imho everything that either is returned by the request
(for instance on a get onto th
Hey JueiTing,
I'm not sure if Hadoop is needed here.
What is the current performance characteristics for the shortest path you are
using?
You could take a decent machine and just fire up, e.g. blocks of 10k node pairs
to a ThreadPoolExecutor with cores*2 threads.
Each of those tasks only has to
Looks really good, especially the last, interactive one.
http://worrydream.com/VisualizingEdgeWeights/
Cheers
Michael
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Could you please share your complete project including the detailed steps you
are executing to generate the exe. (e.g. via dropbox)
With only fragments of the information we can only guess at most. And with the
shared project perhaps also other mailing-list users can help as well.
Thanks so muc
e application servers and neo will handle keeping all
> instances in sync for me. How does that work in terms of transactions and
> concurrency? Is all the data replicated immediately, or is it more like the
> eventual consistency in Amazon SimpleDb.
>
> Thanks a lot for your
I'm no expert in OSGi so I did just the minimal thing, adding bundlor
information to the maven build. This is obviously not successful enough.
So I would be very happy I someone would pull spring data graph put in the
correct OSGi information and send me a pull request.
Cheers
Michael
Am 13.0
at spring-data-graph is packaged as a OSGi
> compatible jar, so using spring-dm too should do it.
>
>
> [1] http://wiki.escapek.org/display/DEV/Neo4j+community+edition+installation
>
> 2011/5/13 Michael Hunger
>
>> I'm no expert in OSGi so I did just the minimal
)
>
>
>
> 2011/5/13 Nicolas Jouanin
>>
>> Well, at the minimum, it's only a question of adding some extra headers
>> (Bundle-Symbolic, Export-Package; ...) in the package MANIFEST and this can
>> be done automatically using the maven-bundle-plugin.
>
would be nice if some of you would reply to his tweet
We should also collect your testimonials somewhere.
Thanks Michael
sschlansker (@sschlansker)
14.05.11 03:49
(FB) Steven Anyone got any experience with neo4j? Curious about trying it out,
wondering if anyone's worked with it. http://on.fb.me
Anfang der weitergeleiteten E-Mail:
> Von: Andy Clement
> Datum: 17. Mai 2011 01:48:58 MESZ
> An: Michael Hunger
> Betreff: Fwd: [Neo4j] Spring Data Graph in an OSGi environment (error while
> AJ-enhancing the config file)
>
> Hi Michael,
>
> I heard back from G
the problem is that the concrete class is annotated with @NodeEntity thats why
the interface MyClass isn't extended to extend NodeBacked
for elementClass you should use the concrete class
for the repo you might try to have MyClass extend NodeBacked
will look into it later today
Michael
Sent
Is your Concept also an interface?
Then you might try the same solution.
* either annotate Concept with @NodeEntity too.
* have Concept extend NodeBacked on itself
* elementClass should rather refer to the concrete implementation (this might
work with the interface though as it is just used to
Julien,
SDG also uses some 1.6 language features (but no classes that were only
introduced in 1.6) but I think the impact there would be minimized.
It uses AspectJ 1.6.x though, don't know if that relies on Java 1.6 features.
Will check with the AJ project lead.
I forwarded your request to our
It could be that the " : " as delimiter is taken by the property file as delim,
resulting in:
> "org.neo4j.server.database.location=c:" = "/graphdb"
Can you have a look if it starts a datasource in the normal server directory:
data/graph.db
Otherwise try to use just /graphdb without the c:
C
Only if you don't iterate fully or use getSingleResult();
Cheers
Michael
Am 19.05.2011 um 17:42 schrieb Rick Bullotta:
> The docs say so. ;-)
>
> -Original Message-
> From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
> Behalf Of Marko Rodriguez
> Sent: Thursd
what abt rel types, dirs and id's?
Then we can get back subgraphs with full node and rel info via traversers.
and if we go compact we should either ditch whitespace as well or support
gzipped output.
M
Sent from my iBrick4
Am 21.05.2011 um 12:09 schrieb Jim Webber :
> Oh, I just thought:
>
Just saw that: http://blog.andrewvc.com/why-arent-you-using-messagepack
Quote from the intro:
JSON is a fantastic format, anywhere people in your organization want to reach
for XML, it's always a good thing to ask the question "Why not JSON?". The
question I'd like you to ask the next time you'r
>>>>> has to to know the spring data neo4j bundle, because this aspectj
>>>>>> "enhancements" are performed there?
>>>>>>
>>>>>>
>>>>>> Best regards
>>>>>> James
>>>&g
Paul,
you have actually two (or more) options, as we did in Spring-Data-Graph
(http://springsource.org/spring-data/neo4j) you can add your type to the node
and create an index named like the type to which you add your nodes. So you can
find nodes by type and (custom) id. To be able to find all
In Spring Data Graph we did this by indexing the relationships by type
index.forRelationships("relTypes").add(rel,"types",rel.getType())
Michael
Sent from my iBrick4
Am 27.05.2011 um 17:56 schrieb Chris Baranowski :
> In http://wiki.neo4j.org/content/Design_Guide under the section "Organizin
Chris,
it depends how the type nodes are used. If you want to use them within a
traversal (i.e. a starting point to partially traverse over your typeset I
would keep them linked to the supertype nodes.)
For relationships this is rather a workaround. In SDG these are covered by
strategies that
I never thought we would make it into the finals. Really cool.
If you'd like us to win this, please vote for us. We could spend the money for
instance on behalf of our user groups.
http://vote.jax-awards.com/
Cheers
Michael
P.S. Please spread the word :)
__
you could use cache_type=weak
in the db properties
you can easily introspect java programs (heap) using jmap jconsole or visualvm
what version of neo4j are you using?
index.flush just sets a flag for immediate index querying
Sent from my iBrick4
Am 01.06.2011 um 19:18 schrieb Paul Bandler :
erImpl constructor? I've tried both and doesn't
> seem to help. Is there some way I can verify that it's being used?
>
> I'm using 1.3
>
> On 1 Jun 2011, at 18:49, Michael Hunger wrote:
>
>> you could use cache_type=weak
>> in the db properties
>
I'll be hacking movie + graph + recommendation stuff at the MovieHackDay
(http://moviehackday.com) in Berlin this weekend.
Perhaps working on some nice rec-algos for cineasts (the spring data graph
sample). Or perhaps port it to ruby and our new jruby-server-extension.
I saw that Achim and Pere
which lib are you referring to?
Michael
Sent from my iBrick4
Am 03.06.2011 um 16:19 schrieb Aniceto Pérez y Madrid
:
> BODY { font-family:Arial, Helvetica, sans-serif;font-size:12px; }
> Hi
> Has the Java client lib any way to perform calls to list and
> call serve
Hi,
It was really a great event. Perfectly organized by MoviePilots.de (Jannis)
where Pere works as well.
You can find all information about the event here: http://moviehackday.com and
of course http://twitter.com/moviehackday (wiki
http://wiki.moviehackday.com/mediawiki/index.php/Berlin_2011)
Hi,
while hacking at the moviehackday 2011 in Berlin I realized that people were
re-creating a neo4j/graphdb movie domain model time and again.
I did it at least 3 times in recent example projects and there people also
re-did the existing work.
So I thought if it would be sensible to provide r
l
Am 06.06.2011 um 21:20 schrieb Eelco Hillenius:
> Hi Peter,
>
>> Eelco,
>> while REST is not a very performant way to access any low level API
>> directly, there is a Java Wrapper for the Neo4j API over REST from Michael
>> Hunger https://github.com/jexp/neo4j-ja
But also running the imdb importer takes just a few seconds.
And you could easily run the importer from the command line if you wished.
But I second more options to import data into a graph, graphml is one option
(which should imho come with neo4j).
Other importer/exporters I'd think of are dot-
Hi RR,
that sounds fantastic. Do you think you could put this email body into a blog
post? It already has the necessary format
and depth.
We could perhaps also have a guest post on Neo4j.org that covers that.
Looking forward to your release. It would be very nice if you could put up a
small sa
Marcello,
I have a question regarding your domain. Is the relationship really
bidirectional?
I.e. are there permissions that go _from_ the application, _to_ the user?
You really only need both if you have relationships that might be incoming and
outgoing and you want to collect all of them.
I
Isn't there also some maven plugin that re-wraps/re-packages libraries as osgi
bundles?
Michael
Am 08.06.2011 um 09:57 schrieb Peter Neubauer:
> Super,
> Nicolas has done an amazing job with examples for OSGi. I think you should
> fork https://github.com/escapek/neo4j-osgi-howto and update/add
Perhaps it is really best to model the "bookmark" as node as well. Which is how
you would model a hypergraph in Neo4j.
Then it is natural to have tag nodes pointing to the bookmark node.
For instance you want to store when user bookmarked the link, so that you can
order his bookmarks (recent fi
I recreated Daniels code in Java, mainly because some things were missing from
his scala example.
You're right that the index is the bottleneck. But with your small data set it
should be possible to cache the 10m nodes in a heap that fits in your machine.
I ran it first with the index and had a
your query key should be "name"
not "actors"
Michael
Sent from my iBrick4
Am 09.06.2011 um 16:49 schrieb Pablo Pareja :
> Hi all!
>
> Recently I noticed that some fulltext indexes I created and populated in my
> project in the Batch insertion
> phase are not working as expected.
> I've carrie
and you should use index.query(key,querystring) not get for fulltext queries
Sent from my iBrick4
Am 09.06.2011 um 17:04 schrieb Pablo Pareja :
> Hi again,
> I just found out that I had the wrong name for querying the actors index,
> still when I change it for "name"
> like this:
>
> System.ou
You could use Neoclipse to visualize your graph:
http://wiki.neo4j.org/content/Neoclipse_Guide
Cheers
Michael
Am 09.06.2011 um 21:49 schrieb lakel:
> hello;
>
> I created a hierarchy with neo4j and I need to see it in a GUI.
> how i should to make it with neo4j?
>
> thank you.
>
>
> --
> V
Aseem,
Josef's suggestion is pretty cool and very powerful.
I would start simple by modeling the bookmark as a node and have the tag-events
only being
relationships (with properties) from the actual tag to the bookmark node.
In the end it all depends on your usage scenarios. What kind of funct
t
> org.eclipse.jdt.internal.junit.runner.RemoteTestRunner.runTests(RemoteTestRunner.java:467)
>at
> org.eclipse.jdt.internal.junit.runner.RemoteTestRunner.runTests(RemoteTestRunner.java:683)
>at
> org.eclipse.jdt.internal.junit.runner.RemoteTestRunner.run(RemoteTe
No,
Neoclipse is a standalone application.
There are lots of other visualizations for graphs possible:
http://wiki.neo4j.org/content/Visualization_options_for_graphs
Cheers
Michael
Am 09.06.2011 um 23:46 schrieb lakel:
> hello;
>
> I have developed with JBuilder
> I can import into JBuilder n
But you're not trying to run Neo4j in the gwt client side code but rather on
the server?
How exactly do you start-up your application?
The classpath you supplied is imho the build-classpath and not necessarily the
run-classpath? Can you verify that?
you can get the runtime classpath by using j
Romiko,
the gremlin plugin is currently separate from the Neo4J-Server it will be
included with one of the next releases.
Until then please go to.
https://github.com/neo4j/neo4j-gremlin-plugin
build the jar using maven and then copy that to your servers plugins directory.
The gremlin file you c
.jar;C:\Users\Ian\Dev\PFE\pfe\lib\neo4j-shell-1.4.M03.jar;C:\Users\Ian\Dev\PFE\pfe\lib\neo4j-udc-1.4.M03.jar;C:\Users\Ian\Dev\PFE\pfe\lib\server-api-1.4.M03.jar;C:\Users\Ian\Dev\PFE\pfe\lib\lucene-core-3.0.1.jar
>
>
>
>
> On Thu, Jun 9, 2011 at 19:32, Michael Hunger
> wrote
.jar;C:\Users\Ian\Dev\PFE\pfe\lib\org.apache.servicemix.bundles.jline-0.9.94_1.jar;C:\Users\Ian\Dev\PFE\pfe\lib\neo4j-shell-1.4.M03.jar;C:\Users\Ian\Dev\PFE\pfe\lib\neo4j-udc-1.4.M03.jar;C:\Users\Ian\Dev\PFE\pfe\lib\server-api-1.4.M03.jar
>
>
>
> On Thu, Jun 9, 2011 at 20:32, Michael Hunger
Tatham,
what version of neo4j-server are you running, and can you please post the
content of the conf/neo4j-server.properties file?
Thanks
Michael
Am 07.06.2011 um 04:20 schrieb Tatham Oddie:
> Howdy!
>
> Neo4j n00b here ...
>
> My /webadmin/ console loads but doesn't let me create nodes, r
hnologies de l'Information
> École de technologie supérieure
> [514] 814-0136
>
>
>
> On Thu, Jun 9, 2011 at 21:03, Michael Hunger
> wrote:
>> Ian,
>>
>> is that web-server a stock tomcat or jetty or something running an OSGi
>> environment?
>&g
get back to you with the findings later.
Michael
Am 10.06.2011 um 09:02 schrieb Paul Bandler:
>
> On 9 Jun 2011, at 22:12, Michael Hunger wrote:
>
>> Please keep in mind that the HashMap of 10M strings -> longs will take a
>> substantial amount of heap memory.
>>
Wait for our spring data graph 1.1.0.M1 release on Monday :)
it will be updated to Neo4j 1.4.M04
Cheers
Michael
Am 10.06.2011 um 11:55 schrieb Vipul Gupta:
> Please let me know..
> I want to use the latest version of neo4j say " Neo4j 1.4 M03 “Kiruna
> " with spring data graph. WHat do I do ?
project itself, I suppose
> I could share the config stuff. What config are you referring to?
>
> --
> Ian Bussières
> Étudiant en Génie des Technologies de l'Information
> École de technologie supérieure
> [514] 814-0136
>
>
>
> On Fri, Jun 10, 2011 at 01
If you mean Neo4j-Server (and High Availability), yes, the indexing is
available regardless it is part of the graph database infrastructure.
Cheers
Michael
Am 10.06.2011 um 18:51 schrieb MyD:
> Is it possible to use the luncene indexing with neo4j sharding or can it be
> only used with neo4j
Another idea is a merge after the fact, so either in a nightly batch or during
a get operation duplicates are discovered they are merged.
Cheers
Michael
Am 10.06.2011 um 18:55 schrieb Rick Bullotta:
> Good point. Same would apply to relationship-based indexing, I suppose. In
> our use case, a
I am wondering how the final scoring / ranking will be done for the full
> text indexing if the distributed node indexing works.
> Maybe you can help here further. Thanks in advance.
>
> Cheers,
> MyD
>
>
>
> On Sat, Jun 11, 2011 at 1:59 AM, Michael Hunger <
> mi
ned some of the stuff in the war folder. Oh and took out all the
> .jar files there too, otherwise this was just way to huge to share.
> Hope this will shine some light on the problem :S
>
>
> On Fri, Jun 10, 2011 at 07:18, Michael Hunger
> wrote:
>> Eclipse .project and .cl
If you iterate through all nodes and get all relationships in only ONE
direction e.g. OUTGOING you get every relationship only once. So this is just a
three liner.
Michael
Sent from my iBrick4
Am 13.06.2011 um 10:14 schrieb Aniceto Perez :
> Hi
>
> I've been testing neo4j by creating a grap
gt; 400 nodes created. Took 2303
> 500 nodes created. Took 2912
> 600 nodes created. Took 2178
> 700 nodes created. Took 2241
> 800 nodes created. Took 2453
> 900 nodes created. Took 2627
> 1000 nodes created. Took 3996
> Creating nodes took 26
AFAIK Andreas Kollegger wanted to take care of migrating the in graph
collection representations from neo4j-util to github. This new repo is a great
place to get the development going on those topics. Great that you pushed it
Niels.
Michael
Sent from my iBrick4
Am 13.06.2011 um 18:36 schrieb
Peter why did you create that repo on your personal account and not on neo4j?
I'd suggest creating a team for that repo and adding you Niels to that team.
What is your github id?
Otherwise Niels you're free to fork the repository make whatever changes you
want to your fork and then issue pull-re
>return result._result;
>}
>}
>
>private int compareAt(int soughtId, int compareSlot) throws FoundIt {
>NodeIdPair candidate = get(compareSlot);
>int diff = soughtId - candidate.getId();
>if (diff == 0)
>throw new Fo
you can use category nodes to connect nodes of a certain type to.
then you can count the nodes using a traversal
you dont have to go via an index to do things like that
Sent from my iBrick4
Am 14.06.2011 um 17:10 schrieb Marko Rodriguez :
> Hi,
>
>> Is it possible that when we create the Au
as it chops its way thru,
> so as I need to be able to run these data loads in a fairly memory
> constrained environment I will experiment with an alternative implementation
> that avoids object allocation. If your profiling suggests otherwise, I’d
> appreciate any input on where
Patrick,
David Montag created a versioned graph approach on github:
https://github.com/dmontag/neo4j-versioning
Perhaps you can take some inspiration from that.
Otherwise:
Books and Elements are nodes, effects would be relationships which have a
timestamp (probably indexed).
The relationship
A problem with a "probably dumb" index in a graph that I created for an
experiment was the
performance of getAllRelationships on that machine (it was a very large graph
with all nodes being indexed).
It was a mapping from long values to nodes, my simplistic approach just chopped
the long values
ry nodes are an interesting approach.
>
> Would you mind validating the graph we've come up with to make sure we're on
> the right track?
>
>
> -- Tatham
>
>
> -Original Message-
> From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On
allow that
Michael
Sent from my iBrick4
Am 15.06.2011 um 05:42 schrieb Vipul Gupta :
> Michael,
>
> I don't see anything released on maven repo yet?
> Please update.
>
> -VIpul
>
> On Fri, Jun 10, 2011 at 3:40 PM, Michael Hunger
> wrote:
>> Wait for our s
ently we're just dealing with agencies and users as our first features,
> then will start building out client management.
>
> (Architecturally, we're building in .NET via the REST API.)
>
>
> -- Tatham
>
>
> -Original Message-
> From: user-boun
Sorry, mixed up the threads on the iphone :(
Will post an SDG update right ahead.
Michael
Am 15.06.2011 um 05:42 schrieb Vipul Gupta:
> Michael,
>
> I don't see anything released on maven repo yet?
> Please update.
>
> -VIpul
>
> On Fri, Jun 10, 2011 at 3:4
lib, test, test-classes and also
>> cleaned some of the stuff in the war folder. Oh and took out all the
>> .jar files there too, otherwise this was just way to huge to share.
>> Hope this will shine some light on the problem :S
>>
>>
>> On Fri, Jun 10, 2011
Dear Graphistas,
After some quiet time that I spend on other important issues, we're back on our
regular release cycle/rhythm.
We discussed the future SDG roadmap with our CEO Emil and decided to work first
on the issues that were
reported by our users here on the mailing list, on the spring f
That is rather a case of warming up your caches.
Determining the traversal speed from the first run is not a good benchmark as
it doesn't represent production usage :)
The same (warming up) is true for all kinds of benchmarks (except for startup
performance benchmarks).
Cheers
Michael
Am 15.
Agelos,
sorry, didn't want to sound that way.
512M ram is not very much for larger graphs. Neo4j has to cache nodes,
relationships in the heap as well as you own datastructures.
The memory mapped files for the datastores are kept outside the heap.
Normally with your 4G I'd suggest using about
I agree with Peter on the jar-file.
And are there any messages in the data/log/* logfiles or in data/messages.log.
Thanks
Michael
Am 15.06.2011 um 18:27 schrieb Peter Neubauer:
> Milena,
> the jar file looks right. Do you have the source code for your Plugin
> somewhere and can send it over?
>
Angelos,
I spoke with Johan and he said that traversal iterations than scale not
linearly with the numbers of rels indicate a configuration issue or are a bug.
Craig reminded me that on Windows the memory mapped buffers are in the heap.
Could you please increase your heap to 2 or 3 GB an rerun
r conceptual). but i'm still determined
> to make it happen (publish the thing online) before summer end.
>
> On Wed, Jun 15, 2011 at 10:17 AM, Michael Hunger
> wrote:
>> Dear Graphistas,
>>
>> After some quiet time that I spend on other important issues, we&#x
can be downloaded.
>
>
> On Thu, Jun 16, 2011 at 6:50 PM, Michael Hunger
> wrote:
>> You could just use the direct repository factory for that.
>>
>> directGraphRepositoryFactory.createGraphRepository(clazz).findAll()
>>
>>
>> normally you wou
yes it does. one tx per batch
M
Sent from my iBrick4
Am 17.06.2011 um 19:17 schrieb Aseem Kishore :
> Quick q: will the new REST API batching feature treat the operations as a
> single transaction? That would be convenient for some scenarios I think,
> like swapping two nodes in a linked list.
Also,
what technology are you writing those map-reduce jobs with ? (framework,
runtime-env, etc).
Some code samples would be great as well.
Cheers
Michael
Am 17.06.2011 um 22:24 schrieb Jim Webber:
> Hello Sulabh,
>
> We're going to need a little more information before we can help.
>
> Ca
Hi Sulabh,
what do you mean by 'local' mode?
The batch inserter can only be used in a single threaded environment. You
shouldn't use it in a concurrent env as it will fail unpredictably.
Please use the EmbeddedGraphDatabase instead.
Michael
Am 17.06.2011 um 23:20 schrieb sulabh choudhury:
>
> api but fails when I try to run in distributed mode.
>
> On Fri, Jun 17, 2011 at 2:25 PM, Michael Hunger
> wrote:
> Hi Sulabh,
>
> what do you mean by 'local' mode?
>
> The batch inserter can only be used in a single threaded environment. You
> shou
Right now this works only with the getElements().add method.
But then you don't get all the graph methods (traversals and such).
We discussed some time ago writing a virtual graph layer on top of the real
nodes and relationships for SDG.
(That should be then used to have a simpler handling of at
Also,
Jim just pointed you to the top-level metadata directory in maven:
An example for a lower level one, that actually contains the sources is:
http://m2.neo4j.org/org/neo4j/neo4j-kernel/1.4-SNAPSHOT/
The milestones and releases are on maven-central (including the sources - btw.
if you set
ayer to worth
> including soon.
>
> Meanwhile can you elaborate what you meant by transient index ?
> I would like to keep a very simplified design for transient graphs and not
> persist any nodes at all if possible.
>
>
>
> On Sun, Jun 19, 2011 at 2:34 AM, Michael Hunger
&g
> Please elaborate .
>
> Thanks for your help .
>
>
> On Sun, Jun 19, 2011 at 2:34 AM, Michael Hunger
> wrote:
> Right now this works only with the getElements().add method.
>
> But then you don't get all the graph methods (traversals and such).
>
> W
Is that the python REST binding or the python binding for a local graph
database?
If you run the server you have to work with the REST API (and bindings for
that):
http://components.neo4j.org/neo4j-server/snapshot/rest.html
and here
http://docs.neo4j.org/chunked/1.4-SNAPSHOT/rest-api.html
one
Which parts of webadmin are absolutely critical?
What about neoclipse readonly?
Sent from my iBrick4
Am 23.06.2011 um 19:00 schrieb Rick Bullotta :
> Welcome to my world, Paul...
>
> Web applications that don't recognize the realities of the "enterprise
> desktop" won't ultimately be able to
101 - 200 of 714 matches
Mail list logo
