Re: [Neo4j] RDF Examples not working - parent-pom

Thanks for the fast answer, i am just trying it out at the moment. But your answer brings me to another question. You wrote "legacy" projects. I know Neo4J is no RDF/Triple/Quad Store but what are the plans for the RDF libs to use Neo4J as such? Kind regards. --- Thomas FRITZ web http://fritz

Re: [Neo4j] RDF Examples not working - parent-pom

Hi Thomas, there is a more complete rdf / sail implementation in tinkerpop that runs easily on top of neo4j. Please check that out and report back if it fits your needs: https://github.com/tinkerpop/blueprints/wiki/Sail-Ouplementation I already pinged Davy asking him to port his example to thi

Re: [Neo4j] We now have an automatic discussion forum on the Nabble Mailing List Archive

Cool ! It looks much more usable than the mailing list ;) Cheers, Pablo On Thu, Jul 14, 2011 at 10:04 PM, Michael Hunger < michael.hun...@neotechnology.com> wrote: > I forgot two things: > > 1) I changed all the links on neo4j.org that previously pointed to the > ugly mailman archive page to p

Re: [Neo4j] RDF Examples not working - parent-pom

Thomas, I imported the repositories from svn, repaired them and pushed them to github. https://github.com/neo4j-contrib Next steps will be updating them to the current version (1.4.) Cheers Michael Am 15.07.2011 um 10:35 schrieb Thomas Fritz: > Thanks for the fast answer, i am just trying it

Re: [Neo4j] RDF Examples not working - parent-pom

Thank you so far! :) --- Thomas FRITZ web http://fritzthomas.com twitter http://twitter.com/thomasf 2011/7/15 Michael Hunger : > Thomas, > > I imported the repositories from svn, repaired them and pushed them to github. > > https://github.com/neo4j-contrib > > Next steps will be updating th

[Neo4j] Getting sorted results from a traversal

HI! I am on the situation of having to traverse neo4j, and then expect the resultset returned to be ordered in a certain order. I've been researching a bit over the traversal API, but I did not find anything related to that. I really will appreciate any tip on that!! BTW > I expect to be possible

Re: [Neo4j] Getting sorted results from a traversal

Hi Pere, To sort you need to have all your results. Thus, in Gremlin (and hopefully you can do the mapping to the core Neo4j traverser framework), results = [] g.v(1).out('friend').out('likes') >> results // what my friends like results.sort{a,b -> a.name <=> b.name} // sort resultant vertices

Re: [Neo4j] Getting sorted results from a traversal

Hi,You basically have two options. If your result set is not too big, you can sort it in memory, though that approach may consume too much memory if the result set is very large. In that case you can use SortedTree (see: https://github.com/peterneubauer/graph-collections/tree/master/src/main/ja

Re: [Neo4j] Getting sorted results from a traversal

Well, this is great if I want to do all the math in memory, but I expect to do the computation by the db. / purbon On 15 July 2011 16:10, Marko Rodriguez wrote: > Hi Pere, > > To sort you need to have all your results. > > Thus, in Gremlin (and hopefully you can do the mapping to the core Neo4j

Re: [Neo4j] [Blog Post] Graphs, Brains, and Gremlin

Cool post, Marko! Added a comment and a book recommendation to your blog. -Original Message- From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On Behalf Of Marko Rodriguez Sent: Thursday, July 14, 2011 4:32 PM To: gremlin-us...@googlegroups.com Cc: Neo4j user disc

Re: [Neo4j] Getting sorted results from a traversal

The DB would do it in memory too, wouldn't it? In the case of a complex traversal, indexes don't really apply, since the ordering and the traversal order are unrelated, so you'd generally need to sort in memory anyway. Whether you do it as you add elements to the traversed list of "stuff" or d

Re: [Neo4j] Getting sorted results from a traversal

Hi, Ah. Then I would recommend using a persistent data structure such as the one the Neil discussed in his follow up post. Marko. http://markorodriguez.com On Jul 15, 2011, at 9:04 AM, Pere Urbon Bayes wrote: > Well, this is great if I want to do all the math in memory, but I expect to > do t

Re: [Neo4j] Getting sorted results from a traversal

Hi Pere, Can you elaborate on your graph structure? Thanks, David On Fri, Jul 15, 2011 at 8:04 AM, Pere Urbon Bayes wrote: > Well, this is great if I want to do all the math in memory, but I expect to > do the computation by the db. > > / purbon > > On 15 July 2011 16:10, Marko Rodriguez wrote

Re: [Neo4j] [Blog Post] Graphs, Brains, and Gremlin

Hi Rick, > Added a comment and a book recommendation to your blog. Thanks. "On Intelligence" is the first reference in the references section of the post --- along with some other goodies. Thanks for reading and commenting, Marko. http://markorodriguez.com

Re: [Neo4j] Getting sorted results from a traversal

Well the graph structure is not relevant here, I think. The property I expect to be sorting is on the destination node, so I can do the traversal and then expect to run the sorting. Please, tell me how the data structure can help me to deal with that order, please? / purbon On 15 July 2011 17:10

Re: [Neo4j] Getting sorted results from a traversal

I would think that the graph structure definitely matters, in that there may be optimizations that can be achieved via indexing/querying vs traversal and sorting (or a hybrid of the two) depending on the specifics. -Original Message- From: user-boun...@lists.neo4j.org [mailto:user-boun..

Re: [Neo4j] Getting sorted results from a traversal

Well in fact, I expect to order the resulting set of nodes by a property on that end nodes. But This class cold also help on some use cases I think. / purbon On 15 July 2011 16:43, Niels Hoogeveen wrote: > > Hi,You basically have two options. If your result set is not too big, you > can sort it

Re: [Neo4j] Getting sorted results from a traversal

Yes the graph structure is relevant, but I am just saying I don't know how the structure can help me in this use case. All that I want is to do a traversal, and then order the expected result. It will be possible If I only use neo4j as a traversal thing, and then another system as a property store

Re: [Neo4j] Getting sorted results from a traversal

Well, the thing is that the database can easy deal with that, as the relational system do. / purbon On 15 July 2011 17:08, Rick Bullotta wrote: > The DB would do it in memory too, wouldn't it? In the case of a complex > traversal, indexes don't really apply, since the ordering and the traversa

Re: [Neo4j] Getting sorted results from a traversal

A few questions/thoughts: - Do you have any expectation/prediction of the number of nodes satisfying the query? - Do you care about *all* results or only the top "n" (I ask this because in most cases, a dataset of a zillion ordered records is of little value - often only the "edges" have meanin

Re: [Neo4j] [Blog Post] Graphs, Brains, and Gremlin

Nice. It's a very "though provoking" (pun clearly intended) blog post. I need to read it a couple times to fully grok it. -Original Message- From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On Behalf Of Marko Rodriguez Sent: Friday, July 15, 2011 11:11 AM To: Ne

Re: [Neo4j] Getting sorted results from a traversal

But you couldn't easy do a complex traversal with an RDBMS. ;-) I suspect that even if you could write some magic SQL to do so, you'd almost certainly lose the benefits any optimized sorting/ordering that indices provide, so even the RDBMS would have to post-process the sort. If the traversal i

Re: [Neo4j] [Blog Post] Graphs, Brains, and Gremlin

> Nice. It's a very "though provoking" (pun clearly intended) blog post. I > need to read it a couple times to fully grok it. I put many links to associated reading (primarily on Wikipedia). If you don't have experience with elementary cognitive neuroscience, then you can learn all you need t

[Neo4j] Cypher request with where clause on relations count

Hi, I have 2 kind of nodes (let's say A and B) which are related using a relation of type 'USES'. I want to count all the type A nodes which have only 1 relation to B type node and all the type A nodes which have more than one relation to B type node. I am using neo4j server and I am currently

[Neo4j] Verifying the relationship between two nodes

Hi, I'm using: ruby 1.9.2, rails 3, neo4j and neography. I have the following nodes and relationships: node1 = $neo.create_node(:id => "1", :name => "Diego") node2 = $neo.create_node(:id => "2", :name => "Jhon") $neo.create_relationship(:knows, node1, node2) My question is, how can i verify if th

Re: [Neo4j] Verifying the relationship between two nodes

Diego, this is code from one of my neography apps: https://github.com/jexp/birdies @users.outgoing(:USER) << user if @users.rels(:USER).outgoing.to_other(user).empty? @users and user are your two nodes. So it would be: ! node1.rels(:knows).outgoing.to_other(node2).empty? Cheers Michael Am

Re: [Neo4j] Getting sorted results from a traversal

You might also try to use cypher for your traversal which is able to order (also in memory of course). See the screencast I did: http://neo4j.vidcaster.com/U2Y/introduction-to-cypher/ It's even the same domain. Cheers Michael Am 15.07.2011 um 17:24 schrieb Rick Bullotta: > But you couldn't e

Re: [Neo4j] Getting sorted results from a traversal

Yeah! well to order in memory I can really deal with that task, for this I really don't need cypher. Don´t take it personally, I know you really want to promote your language, xD! - purbon PD: See you next graphdb meetup in Berlin! On 15 July 2011 19:37, Michael Hunger wrote: > You might also t

Re: [Neo4j] Getting sorted results from a traversal

Hi Rick, On 15 July 2011 17:24, Rick Bullotta wrote: > But you couldn't easy do a complex traversal with an RDBMS. ;-) > Yeah, so you are on me, from neo4j I could only expect to deal really good with traversals, when you need some simple thing like ordering nodes, you can not do it easily. >

[Neo4j] use one index per key or one index for all keys?

I have an index called UniqueIndex, here I am storing emails and ids which you guessed it have to be unique. Is there any performance difference if I store both keys on the same index vs. storing them on two different indexes? Many thanks! ___ Neo4j mail

Re: [Neo4j] Getting sorted results from a traversal

Hi, Pere, my last thought on this is that you might want to use something like JDBM2. http://code.google.com/p/jdbm2/ It has a Maven2 if you do it that way. JDBM2 provides you some Java collection implementations that are persistent to disk... See ya, Marko. http://markorodriguez.c

Re: [Neo4j] Getting sorted results from a traversal

Hey, Actually, I was just Googling and found this cool library: http://code.google.com/p/pcollections/ This way you have Set, Vector, etc. persisted. Perhaps that could help you out Pere. See ya, Marko. http://markorodriguez.com On Jul 15, 2011, at 12:30 PM, Marko Rodriguez wrote: >

Re: [Neo4j] Getting sorted results from a traversal

Marko, Isn't that pretty similar to what https://github.com/peterneubauer/graph-collections provides for Neo4j? David On Fri, Jul 15, 2011 at 11:30 AM, Marko Rodriguez wrote: > Hi, > >

Re: [Neo4j] Getting sorted results from a traversal

Hey, > Isn't that pretty similar to what > https://github.com/peterneubauer/graph-collections > provides > for Neo4j? I dunno. I haven't played with Graph Collections. But I assume so if

Re: [Neo4j] Getting sorted results from a traversal

With our jruby script extension you can write server-side code in ruby that can do that for you. Cheers Michael Am 15.07.2011 um 20:22 schrieb Pere Urbon Bayes: > Yeah! well to order in memory I can really deal with that task, for this I > really don't need cypher. Don´t take it personally, I

Re: [Neo4j] Getting sorted results from a traversal

Jajajaja, Marko I just need to meet you sometime! I always listen good thing about you from Peter and Achim ... I am quite not satisfied, probably I will change somethings on my project in order to fit better with that use case! - purbon On 15 July 2011 20:53, Marko Rodriguez wrote: > Hey, > >

Re: [Neo4j] Getting sorted results from a traversal

After a fast walk throw the code I found that option quite interesting and probably the best fit till now for that problem! I hope I will be able to provide a useful solution for those with the same problem than me... I just tried you say I was expecting neo4j to provide me with something like a s

[Neo4j] get relationships on node during REST traversal

I am trying to return only nodes with a relationship of a given type in a traversal using the REST API. The traversing of relationships is working correctly, and I can successfully filter on properties, but I would like to return only nodes with relationships of a given type, and it is not one of t

Re: [Neo4j] get relationships on node during REST traversal

Mike, what version of Neo4j are you running this against? Please note that the syntax for the traversal parameters changed in 1.4, they all now need underscores instead of spaces. Please try to use max_depth and return_filter. Is there a reason why you chose to use a separate "eval" function d

Re: [Neo4j] NoSuchElementException

Well while inserting the nodes I keep a check batchInserter.nodeExists(node1) so I would guess a node would not be duplicated. Otherwise during a traversal I guess duplicate nodes. IIs there a way I can look into the BtachInsert data before I flush so that I can make sure no duplicate data has been

[Neo4j] Hyperedges and Objects

Hi, is there a possibility to store hyper edges in Neo4j? Is there a plan to implement this? Will Neo4j get the ability to store complex types in addition to primitve data types for properties of nodes and relationships? -- Best regards Norbert Tausch _

Re: [Neo4j] We now have an automatic discussion forum on the Nabble Mailing List Archive

I embedded it now at http://neo4j.org/forums Also all links to the nabble site are now redirected by them to our page. Thanks again to Andrew Serff for getting this up and running. And to Nabble for the ease of integration. Cheers Michael Am 15.07.2011 um 12:26 schrieb Pablo Pareja: > Cool !

Re: [Neo4j] Hyperedges and Objects

Hyper edges can be emulated. Suppose you want to store the fact "John gives Pete a book". This is indeed a ternary relationship, which would call for an hyper edge. This fact can be stored as follows: Some act of giving --Giver-->JohnSome act of giving --Recipient--> PeteSome act of giving --Gi

[Neo4j] Best practice to avoid Unable to lock store error?

Such as. Unable to lock store [/Users/xxx/db/neostore], this is usually caused by another Neo4j kernel already running in this JVM for this particular store I'm getting this error when the the user tries to insert into the database really fast (e.g, multiple clicks). The design that I use is to o

Re: [Neo4j] Best practice to avoid Unable to lock store error?

Why would you do that? Keep the database open as a singleton instead. - Reply message - From: "noppanit" Date: Fri, Jul 15, 2011 7:00 pm Subject: [Neo4j] Best practice to avoid Unable to lock store error? To: "user@lists.neo4j.org" Such as. Unable to lock store [/Users/xxx/db/neostor

Re: [Neo4j] Hyperedges and Objects

And native support for JSON types is planned as well. Cheers Michael Am 16.07.2011 um 00:52 schrieb Niels Hoogeveen: > > Hyper edges can be emulated. > Suppose you want to store the fact "John gives Pete a book". > This is indeed a ternary relationship, which would call for an hyper edge. >

Re: [Neo4j] Best practice to avoid Unable to lock store error?

Right, that will never be fast enough? What is your reasoning behind shutting down the db after each commit? Cheers Michael Am 16.07.2011 um 01:19 schrieb Rick Bullotta: > Why would you do that? Keep the database open as a singleton instead. > > > > - Reply message - > From: "noppa

Re: [Neo4j] Best practice to avoid Unable to lock store error?

Thanks I will try that. :) -- View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/Re-Neo4j-Best-practice-to-avoid-Unable-to-lock-store-error-tp3173625p3173634.html Sent from the Neo4J Community Discussions mailing list archive at Nabble.com. _

[Neo4j] Neo4j with Tomcat...need a transaction manager

We plan on using neo4j as the database for our website, which will run on Tomcat. Also, we'll be using ActiveMQ for sending messages within neo4j transactions, so that leaves the question of what to use for the transaction manager. Atomikos, JBossTM comes to mind, are we missing anything obvious? D

Re: [Neo4j] GSoC 2011 Weekly report - OSM data mining and editing capabilities in uDig and Geotools

== Weekly report == Hi all, we started the task with the goal to write a new renderer for the OSM graph model for uDig. We want to create a custom renderer that can render the raw OSM dataset as a connected graph in its own layer. I started the design of a new render in uDig to manage the graph-b

Re: [Neo4j] Neo4j with Tomcat...need a transaction manager

Springsource also provides/is working on their own tomcat based XA TM. Perhaps you'd like to check that out. (http://forum.springsource.org/showthread.php?76843-JTA-for-Tc-Server&p=258383#post258383) Otherwise there is only JOTM left. Neo4j can integrate with those TM. See also these blog posts

Re: [Neo4j] Neo4j with Tomcat...need a transaction manager

It's built in for neo4j. Full jta support! - Reply message - From: "etc3" Date: Fri, Jul 15, 2011 7:38 pm Subject: [Neo4j] Neo4j with Tomcat...need a transaction manager To: "user@lists.neo4j.org" We plan on using neo4j as the database for our website, which will run on Tomcat. Also,

[Neo4j] Key/value pairs in Neo4j

Greetings! I tried to tweet this to @mesiru (unsuccessfully, you will see why). ;-) Perhaps by way of example with keys at first. First key/value pair: EmployeeID = 555-33- In a U.S. context, the value is obviously the employees social security number, a number that is assigned by the gov

Re: [Neo4j] Neo4j with Tomcat...need a transaction manager

Thanks, Micheal. The blog post from Chris was from last year; were those changes for JOTM ever added to neo4j? -Original Message- From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On Behalf Of Michael Hunger Sent: Friday, July 15, 2011 8:00 PM To: Neo4j user discuss

Re: [Neo4j] Verifying the relationship between two nodes

Very good Michael, thanks! Yes, it works! In my case i need search by node property(:id), i did so: index = Neography::Rest.new.get_node_index("id", :id, user1.id) return false unless index node = Neography::Node.load(index.first) !node.outgoing(:knows).find{|n| n.id == user2.id.to_s}.nil? Ther

Re: [Neo4j] Neo4j with Tomcat...need a transaction manager

Yes they were added. The XA-TX-Manager is configurable in Neo4j (defaults to our own but if you have an external one like JOTM or Atomikos) then you can configure those to be used. Example implementation for JOTM: https://github.com/digitalstain/JOTMServiceProvider Implementation in neo4j is h

Re: [Neo4j] Verifying the relationship between two nodes

Probably, we should ask Max the author of neography about that. I'm not sure in detail how his Ruby API is mapped to the REST calls. Cheers Michael Am 16.07.2011 um 02:52 schrieb Diego Alvarez Nogueira: > Very good Michael, thanks! > > Yes, it works! > > In my case i need search by node pro

Re: [Neo4j] Neo4j with Tomcat...need a transaction manager

Michael, If I use the default trx manager in neo4j, what connection pool driver should be used in Tomcat? -Original Message- From: user-boun...@lists.neo4j.org [mailto:user-boun...@lists.neo4j.org] On Behalf Of Michael Hunger Sent: Friday, July 15, 2011 9:05 PM To: Neo4j user discussions

[Neo4j] gremlin tables question

this works: - gremlin> t=new Table();v = g.v(2);v.outE.inV.as('node')[0..5].table(t); - ==> v[95] - ==> v[94] - ==> v[93] - ==> v[92] - ==> v[91] - ==> v[90] - gremlin> t - ==> [node:v[95]] - ==> [node:v[94]] - ==> [node:v[93]] - ==> [node:v[92]] - ==> [node:

Re: [Neo4j] gremlin tables question

Hi, Do: t=new Table();v = g.v(2);v.outE.inV.as('node')[0..5].table(t) >> -1; t; Read the first trouble shooting for the reason: https://github.com/tinkerpop/gremlin/wiki/Troubleshooting v.outE.inV.as('node')[0..5].table(t) returns an iterator. v.outE.inV.as('node')[0..5

[Neo4j] Index returns all nodes for value="undefined"!

We're seeing this crazy behavior where our exact index is returning all nodes if we pass a lookup value of "undefined"! E.g.: http://localhost:7474/db/data/index/node/nodes/username/undefined Is this a bug in Neo4j / REST API? Or is this a symptom of some bug we have in our own code? It could ve

[Neo4j] unique relationships?

If I create the same relationship between two nodes, say a-LIKES->b, more than once, a new relationship with a new id is created such that when I look up all of a's LIKES relationships I get b multiple times. I know I can unique this away, but I wonder what the logic of doing it this way is and if

[Neo4j] Auto-index fulltext?

Is the 1.4 auto-index only "exact"? Or can it be configured to be a "fulltext" index? (Btw, it would be awesome if we could have two auto-indexes: one exact, one full-text. It would be great in general if all indexing could be auto. Not sure when you would ever want/need manual indexing.) Aseem _

[Neo4j] Auto-indexing feature request: transform

We transform some of our properties currently before (manually) indexing them. Simple examples are lowercase ("fulltext" indexes supports a "lowercase" config that defaults to true, but "exact" ones don't, I was disappointed to find), but more complex ones are e.g. stripping special characters. It