Hi Deejay,I am working on something that does your point number 1 below, I was
wondering what you mean by plugging in neo4j, we are buildign a mahout cluster
that will run in async mode and will use solr to stream the results to the
caller, solr in turn will also query neo4j to calculate paths
Vipul,
I've built a Spring based web service with neo4j in embedded mode using apache
cxf, let me know what specific issues you are running into.
Thanks
Sent from my iPhone
On Aug 15, 2011, at 5:29 PM, Andreas Kollegger
wrote:
> Hi Vipul,
>
> What was the trouble you were having with Apache
gt; if unit tests would need to be extracted out of the spatial
>> component and
>>>>>> embedded inside the graph-collections component as well or whether
>> we'd
>>>>>> potentially need to write brand new unit tests as well.
>>>>>>
ing left would be to decide if it is ok for it to be based
> > on n-dim doubles or should be generalized to more types.
> >
> > On Tue, Jun 28, 2011 at 11:14 PM, Saikat Kanjilal
> > wrote:
> >
> > > I would be interested in helping out with this, let me know
I would be interested in helping out with this, let me know next steps.
Sent from my iPhone
On Jun 28, 2011, at 8:49 AM, Niels Hoogeveen wrote:
>
> A couple of weeks ago Peter Neubauer set up a repository for in-graph
> datastructures: https://github.com/peterneubauer/graph-collections.
> At
x27;. That kind of question
> could make use of the graph and the spatial extensions to provide an answer
> and show the route on the creative map, even if it is not a real to-scale
> map. Is that what you want to see?
>
> You can try contact me on skype also.
>
> Regards,
are trying to solve, I am sure I will be able to give advice on
> how best to approach it, if it relates to anything else we are doing, or
> whether this is something you would need to put some coding time into :-)
>
> Regards, Craig
>
> On Sun, Jun 5, 2011 at 8:26 PM, Saikat Kanjila
of what your use case is, what
> problem you are trying to solve, I am sure I will be able to give advice on
> how best to approach it, if it relates to anything else we are doing, or
> whether this is something you would need to put some coding time into :-)
>
> Regards, Craig
>
Craig et al,I have an interesting usecase that I've been thinking about and I
was wondering if it would make a good candidate for inclusion inside
neo4j-spatial, I've read through the wiki
(http://wiki.neo4j.org/content/Collaboration_on_Spatial_Projects) and was
interested in using neo4j-spati
tups. You can create the group and I'll join up, then send you the
> >>> badge and set up the sponsorship. Or wait, I'll just attach it.
> >>>
> >>> The pattern I've been using for the group name is "graphdb-".
> >>> I
gt;> The pattern I've been using for the group name is "graphdb-".
>>> I'll help get all the setup done if you create the group first.
>>>
>>> -Andreas
>>>
>>>
>>>
>>> On Jun 4, 2011, at 3:17 PM, Saikat Kanjilal wrote:
>&
Andreas,
This is a great idea, any interest doing this sort of an activity in the
Seattle area. I'd love to help and be involved. I floated the idea earlier and
got a few folks interested and would help organize.
Thoughts?
Regards
Sent from my iPhone
On Jun 4, 2011, at 1:38 PM, Andreas Kolle
Hi Jose,
See the following:
https://github.com/neo4j-examples/java-dijkstra
Andreas has done a great job in showing the use of this algorithm through
examples, is this what you need? I used this t get my POC off the ground.
Regards
> Date: Sat, 14 May 2011 17:32:21 -0700
> From: jai...@estud
Craig et al,
I was wondering if anyone has used neo4j spatial to model traffic and
operational patterns in a theme park. These patterns could include real time
traffic updates, ride closures, wait time management and more. I'd be
interested in looking and building some pieces into neo4j spati
I'd like to propose that we put this functionality into the plugin
(https://github.com/skanjila/gremlin-translation-plugin) that Peter and I are
currently working on, thoughts?
> From: j...@neotechnology.com
> Date: Tue, 19 Apr 2011 15:25:20 +0100
> To: user@lists.neo4j.org
> Subject: Re: [Neo4j
Hi Emil,When you come up to Seattle next time how about Chris Walters, you and
Savas and I get together? Let us know when you're coming and we can have some
good grbeers (graph-beers) and conversation? If anyone else is interested
please ping me.
Regards
> CC: user@lists.neo4j.org
> From: sx
Ummm graph beers, nothing better than that :), I know Bradford because he
organizes the high scalability meetings in this area.
Sent from my iPhone
On Apr 16, 2011, at 7:49 AM, Jim Webber wrote:
> Hi Saikat,
>
> Savas Parastatidis and Bradford Stephens had a bit of a twitter exchange
> abo
Hello Folks,
Anyone in the northwest up for having a neo4j meetup, would love to learn and
share ideas with folks in this neck of the U.S periodically.
Send me a shout if interested.
Regards
Sent from my iPhone
___
Neo4j mailing list
User@lists.neo4j.
Thanks Tobias, I dont believe I have this on my runtime classpath, I'll include
it now.
> From: tobias.ivars...@neotechnology.com
> Date: Thu, 7 Apr 2011 08:06:51 +0200
> To: user@lists.neo4j.org
> Subject: Re: [Neo4j] CNFE in Neo4j Server
>
> The simplest explanation is probably the correct on
You can do all of these things using gremlin and pipes. Check out github for
more details.
Sent from my iPhone
On Mar 26, 2011, at 11:13 AM, Matěj Plch wrote:
> Hi, I have some graph and, part of it is a tree. I simple get root of
> this tree through id. How to simple tranverse only tree und
database.
> http://startupbootcamp.org/- Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Thu, Mar 24, 2011 at 3:48 PM, Saikat Kanjilal wrote:
> > This seems like a useful little utility to have ins
ded graph database does not have such a facility. You'd have to
> manage a timer thread yourself or use perhaps Quartz[1] for sophisticated job
> scheduling.
>
> Cheers,
> Andreas
>
> [1] http://www.quartz-scheduler.org/
>
> On Mar 24, 2011, at 3:08 PM, Sai
Folks,
I was wondering if there's a way to simulate the notion of a cron job inside
embedded neo4j, I nerd to have a way to periodically update a certain property
of each and every node in my graph by calling into a remote service .
Regards
Sent from my iPhone
__
Thanks Peter, I'll be heavily beefing up the methods soon, I have been looking
at Marko's list of basic methods to enter into the service seen in the link
below:
https://github.com/tinkerpop/rexster/wiki/Using-Gremlin
Peter I'll send you some more code soon.
> Date: Tue, 22 Mar 2011 23:43:42 +0
e graph database.
> http://startupbootcamp.org/- Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Fri, Mar 18, 2011 at 5:23 PM, Saikat Kanjilal wrote:
> >
> > Sorry forwarding to the list, acci
tion happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Thu, Mar 17, 2011 at 1:11 AM, Saikat Kanjilal wrote:
> > I've written a Quasi-mashup which loads points from google maps using a
> > background thread in Spr
me client side coding to automate this, accessing
> the map, and posting the points directly into your own server (where of
> course you would have some code adding the points to the database). Does
> this answer your question?
>
> Regards, Craig
>
> On Thu, Mar 17, 2011 at 12:32
Hi Folks,
I was reading through the docs on neo4j spatial and was wondering about a few
things:
1) If I have a google or bing map and I manually plot some points can I use
neo4j spatial to automate the loading of those points into my neo4j db?
2) Are there code samples for neo4j-spatial or impl
Based on all the responses I wil be:1) Using rexster in the immediate to evolve
the architecture towards just using http.2) Work on a server plugin for REST
structured returns
Will be working with Peter on number 2.
> From: okramma...@gmail.com
> Date: Tue, 15 Mar 2011 14:24:28 -0600
> To: jon
Marco et al,I was wondering if its possible to embed gremlin queries inside
http requests that get sent to the REST server. This would be hugely
beneficial to me, I've been trying to simplify our architecture to use the REST
Server and http as opposed to using java and pipes programmatically t
Marko,Thanks for the additional insights, a WeightedPath in the neo4j world is
a path that contains weights between nodes, in the realm of calculating the
shortest path using for example the Dijkstra Algorithm the path weights (in
this case the distances) are all summed up and the path with the
; I recommend the first way for larger projects. See slide #22 here:
> http://www.slideshare.net/slidarko/the-gremlin-in-the-graph
>
> Hope that helps,
> Marko.
>
> http://markorodriguez.com
>
> On Feb 16, 2011, at 2:32 PM, Saikat Kanjilal wrote:
>
> >
>
If you are
> interested, bring it up on the Gremlin-users mailing list and we can help you
> there.
> http://groups.google.com/group/gremlin-users
>
> Hope that helps,
> Marko.
>
> http://markorodriguez.com
>
> On Feb 16, 2011, at 2:09 PM, Saikat Kanjilal wrot
Hi Folks,I've spent the last few days reading documentation around several
aspects of neo4j surrounding extracting a subgraph. However I still dont see
any articles or code examples pertaining to the extraction of a set of paths
from the complete list of paths based on some prearranged criteri
t; Subject: Re: [Neo4j] Graph pattern matching component
>
> Hey Saikat,
>
> The component site has some example code:
> http://components.neo4j.org/neo4j-graph-matching/
>
> Is there something specific you have in mind?
>
> -Andreas
>
> On Feb 11, 2011, at 6:
Hi Everyone,I am reading up on email threads and documentation pertaining to
the pattern matching component and am considering using it to advance the next
set of features for the code. I was wondering if someone has some examples
that they can put on github or document on the wiki for this co
Hi Folks,
I was wondering about the following:
1) Are there plans to build a compact version of neo4j for native mobile apps
2) Is there an example of sharding and the lessons learned and issues that may
come up when going through this. Didn't see anything on the wiki but maybe was
not looking
uplication seen in your graph.
>
> Cheers,
> Tobias
>
> On Wed, Feb 2, 2011 at 2:36 AM, Saikat Kanjilal wrote:
>
> >
> > Tobias,I've done some further analysis on the code that's creating the
> > relationships and have printed out all the contents of each
ve come across this problem too. If its possible to define the
> > relationships between
> > the nodes as a Train, Bus or Walking relationship. You could use a
> > RelationshipExpander
> > to define which relationship types you wish to Traverse when using the
> > fi
+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://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
Hi Folks,I'm slowly but surely climbing the learning path in the neo4j world.
I'm using Dijkstra's algorithm for the shortest path calculation between two
nodes which now seems to be working fine after some code rearranging, however
I'd also like to get the list of available paths between two
ser@lists.neo4j.org
> Subject: Re: [Neo4j] Calculating shortest paths in a large graph
>
> Yes as you can see in the visualization there are 4 equal relationship
> between the nodes, where only one would yield the same information.
>
> Michael
>
> Am 02.02.2011 um 01:19 sch
ue with an analysis of the Dijkstra implementation. To help me
reproduce this, which nodes were you using as starting points when this
occurred?
Thank you for your patience.
Cheers,
Tobias
On Tue, Feb 1, 2011 at 4:35 PM, Saikat Kanjilal wrote:
>
> Tobias,Any updates on this? I think my zip
: Re: [Neo4j] Calculating shortest paths in a large graph
>
> Much better, I'll have a look at this tonight.
>
> -tobias
>
> On Mon, Jan 31, 2011 at 4:35 PM, Saikat Kanjilal wrote:
>
> >
> > Tobias,I apologize, I am creating the zips on the command line and they
&
John,If you havent already take a look at some of the algorithms in mahout,
they are currently using hadoop (http://mahout.apache.org) and it may be the
case where some of their algorithms are taylored more towards hadoop style
data-stores.
Regards
> Date: Mon, 31 Jan 2011 17:34:25 +0100
> Fro
culating shortest paths in a large graph
>
> Much better, I'll have a look at this tonight.
>
> -tobias
>
> On Mon, Jan 31, 2011 at 4:35 PM, Saikat Kanjilal wrote:
>
> >
> > Tobias,I apologize, I am creating the zips on the command line and they
> > a
est paths in a large graph
>
> You can also zip the graph database directory and send it to me or tobias.
>
> Do you run the algorithm just after the insertion of the data or in a
> separate run?
>
> Thanks
>
> Michael
>
> Am 30.01.2011 um 16:44 schrieb Saikat K
a typo, then switching
> algorithm might be a good solution, Dijkstra is not optimal for large
> graphs.
>
> I'd love to help, but I need some more details, because this seems strange
> to me.
> Cheers,
> Tobias
>
> On Sun, Jan 30, 2011 at 3:19 PM, Saikat Kanjilal
> algorithm might be a good solution, Dijkstra is not optimal for large
> graphs.
>
> I'd love to help, but I need some more details, because this seems strange
> to me.
> Cheers,
> Tobias
>
> On Sun, Jan 30, 2011 at 3:19 PM, Saikat Kanjilal wrote:
>
> >
>
Hi Folks,I'm working on a little route planning spring based neo4j service
where I initially load up all my data into neo4j and have about a 100 nodes,
however it seems that I am running into heap space issues when running the
Dijkstra Algorithm for any traversals that are relatively far apart
50 matches
Mail list logo
