I have no word to express my excitement:) Not joking. On Tue, May 31, 2011 at 8:55 PM, Peter Neubauer < peter.neuba...@neotechnology.com> wrote:
> Btw, > > will post a local server build and the plugin to dropbox so you can get on > with it in a while ... WDYT? > > > 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 - Your high performance graph database. > http://startupbootcamp.org/ - Öresund - Innovation happens HERE. > http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. > > > On Sun, May 29, 2011 at 9:41 PM, Peter Neubauer < > peter.neuba...@neotechnology.com> wrote: > > > Marcelo, > > you can use the graphmatching libs through a custom extension, see > > http://docs.neo4j.org/chunked/snapshot/server-plugins.html . Also, > > Ggremlin is accessible through REST using the Neo4j Gremlin Plugin, soon > to > > be packaged as a standard plugin, see > > https://github.com/peterneubauer/neo4j-gremlin-plugin > > > > Once you have done your graphmatching plugin (keep us updated on that > > progress) or the Gremlin plugin, you should be able to use neography to > > point to that URIs. > > > > Does that help? > > > > 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 - Your high performance graph > database. > > http://startupbootcamp.org/ - Öresund - Innovation happens HERE. > > http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. > > > > > > > > On Sun, May 29, 2011 at 9:37 PM, Marcelo Barbudas <nos...@gmail.com > >wrote: > > > >> Hey Jim, > >> > > >> > This list is pretty friendly, and since Neo4j is quite new itself > we're > >> all newbies one way or another :-) > >> > > >> Thanks for making me feel welcome. > >> > >> >> What's the best way to find commonalities between two people (based > on > >> >> likes)? Is it possible to put a weight on the like relationship? Like > >> >> for example if someone likes fish a lot more than bread. > >> > > >> > Using a weighted graph is a pretty sensible idea here. But if you're > >> looking for patterns in a graph (people who like fish and chips, and who > >> like ice-cream) you might also consider using the graph-matching > library: > >> > > >> > https://github.com/neo4j/graph-matching/ > >> > > >> > In the MVN repo (ivy): > >> > > >> > <dependency org="org.neo4j" name="neo4j-graph-matching" rev="0.8"/> > >> > > >> Is it possible to use this with the REST server and the ruby 'neography' > >> wrapper? > >> > >> -M. > >> _______________________________________________ > >> Neo4j mailing list > >> User@lists.neo4j.org > >> https://lists.neo4j.org/mailman/listinfo/user > >> > > > > > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
