Yeah, you're right this wouldn't be a good idea for big graphs, and probably having different behaviors implemented depending on the size of the graph neither.
What about showing nodes that fulfill a set of rules based on their properties, i.e. something like which is already implemented for the visualization profiles? In my case that would be sufficient cause I always add a property NODE_TYPE for all nodes, that way I could just create a couple of filters like 'where property node_type = X ' and then retrieve only the nodes of the type I'm interested in (regardless where they are situated in the graph). On Tue, Oct 18, 2011 at 2:56 PM, Peter Neubauer < [email protected]> wrote: > Pablo, > I think this is mostly an issue of bandwidth and performance in > processing the whole graph on the client side, alternatively > generating some aggregated view on the server side but be less > responsive on the client side. > > How do you imagine such interaction working? Got a hunch? > > 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 Tue, Oct 18, 2011 at 2:51 PM, Pablo Pareja <[email protected]> wrote: > > Well, I'd rather like to have the option of visualizing the whole graph > > without having to specify > > a depth value (cypher option) or direct IDs/Index lookup(Peter's) , cause > I > > can think of different scenarios where > > that wouldn't be possible in principle. > > Would it be very difficult to implement the whole graph option? > > There already is a method in GraphDatabaseService class where you can > access > > all nodes (then rels. implicitly as well) > > in your graph; so, couldn't you use this method to somehow achieve this? > > Cheers, > > > > Pablo > > > > On Tue, Oct 18, 2011 at 1:23 PM, Peter Neubauer < > > [email protected]> wrote: > > > >> Or, > >> as long as you can address the nodes, e.g. via Index Lookup or direct > >> IDs, which should return disconnected graphs, too. > >> > >> 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 Tue, Oct 18, 2011 at 1:22 PM, Jacob Hansson > >> <[email protected]> wrote: > >> > No, there is currently no way to do that. > >> > > >> > Once we add cypher support to the databrowser search bar, you would be > >> able > >> > to write a cypher query that returns everything at some arbitrary > depth, > >> > which in practice could be used to return the whole graph, as long as > >> it's > >> > all connected, would that be good enough? > >> > > >> > > >> > /jake > >> > On 2011 10 18 10:52, "Pablo Pareja" <[email protected]> wrote: > >> > > >> >> Hi, > >> >> > >> >> Can this be achieved without having to access a subset based on some > >> >> property/id/etc... and then > >> >> opening all incoming/outgoing relationships and so on? > >> >> Cheers, > >> >> > >> >> Pablo > >> >> > >> >> -- > >> >> Pablo Pareja Tobes > >> >> > >> >> My site http://about.me/pablopareja > >> >> LinkedIn http://www.linkedin.com/in/pabloparejatobes > >> >> Twitter http://www.twitter.com/pablopareja > >> >> > >> >> Creator of Bio4j --> http://www.bio4j.com > >> >> > >> >> http://www.ohnosequences.com > >> >> _______________________________________________ > >> >> Neo4j mailing list > >> >> [email protected] > >> >> https://lists.neo4j.org/mailman/listinfo/user > >> >> > >> > _______________________________________________ > >> > Neo4j mailing list > >> > [email protected] > >> > https://lists.neo4j.org/mailman/listinfo/user > >> > > >> _______________________________________________ > >> Neo4j mailing list > >> [email protected] > >> https://lists.neo4j.org/mailman/listinfo/user > >> > > > > > > > > -- > > Pablo Pareja Tobes > > > > My site http://about.me/pablopareja > > LinkedIn http://www.linkedin.com/in/pabloparejatobes > > Twitter http://www.twitter.com/pablopareja > > > > Creator of Bio4j --> http://www.bio4j.com > > > > http://www.ohnosequences.com > > _______________________________________________ > > Neo4j mailing list > > [email protected] > > https://lists.neo4j.org/mailman/listinfo/user > > > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > -- Pablo Pareja Tobes My site http://about.me/pablopareja LinkedIn http://www.linkedin.com/in/pabloparejatobes Twitter http://www.twitter.com/pablopareja Creator of Bio4j --> http://www.bio4j.com http://www.ohnosequences.com _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user

