From: Ian Tompsett <iantompset...@gmail.com>
Date: Thu, 15 Nov 2012 21:09:05 -0800 (PST)
Local: Fri, Nov 16 2012 12:09 am
Subject: Re: [Neo4j] Need help with designing deep tree of type relationships - can Neo4J cope?
OK, I think I've created a suitable (albeit very small) test case
Not surprisingly this returns queries pretty quickly, but should be enough
Hopefully it's clear enough - TypeA is the start point (node 4) and it's an
So initially what I'd like is the most efficient cypher query for detecting
Thanks again for your help
On Friday, 16 November 2012 07:53:37 UTC+11, Ian Tompsett wrote:
> Thanks Peter
> I'll have a look at the best way to get a sample for you - I should be
> In the meantime, re "the first down each path": my cypher queries return a
> For example given a single path of type usage: *A*
> And say A, D and F are known entity types, when starting from A I would
> So far I've only managed to get my queries to return all of the paths in
> Hope that makes it a bit clearer.
>> Thanks Ian!
>> /peter neubauer
>> G: neubauer.peter
>> Neo4j 1.8 GA -
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.