Hi all, I have three kinds of nodes A, B and C. Both type A and B (distinguished by a property) have a relationship of the same type to node type C. I want to find nodes C which have a relationship to A but not to B.
The only idea I came up with is to have a query return all A nodes having a relationship to C as a START nodeset and then count B nodes having a relationship to the nodes from the set with count 0. But as START only accepts node id or index queries, that's not possible. Do you plan to include set operations in cypher? UNION and INTERSECTION of query results would also be an approach. Or, even better, is there a solution using current language features? I'm still quite new to the topic, so I might have missed something. -- View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/cypher-question-subqueries-possible-tp3543685p3543685.html Sent from the Neo4j Community Discussions mailing list archive at Nabble.com. _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
