想象一下下面的图表:

目标是查询两个实体之间的所有连接节点(本例中为“Main”和"Other“),但过滤掉相互的后代。换句话说,我希望结果集只包含a和 B ,但是不包含 c,因为C是B的后代,B已经包含在结果集中。
发布于 2017-12-08 20:29:40
我使用以下示例数据集再现了您的场景:

这个查询应该可以:
// match common child nodes between 'main' and 'other'
MATCH (:Node {name : "Main"})-[:child]->(child:Node)<-[:child]-(:Node {name : "Other"})
// match the children of child when exists
OPTIONAL MATCH (child)-[:child]->(n:Node)
// store children and childrenOfChild in separeted arrays
WITH collect(child) as children, collect(n) as childrenOfChild
// filter ...
WITH filter(child in children WHERE NOT child IN childrenOfChild) as directChildren
UNWIND directChildren as directChild
// return only direct child
RETURN directChild产出:
╒═════════════╕
│"directChild"│
╞═════════════╡
│{"name":"b"} │
├─────────────┤
│{"name":"a"} │
└─────────────┘发布于 2017-12-08 21:24:51
如果我正确地理解了问题的情况,那么您需要找到这样的子节点,从原始节点得到的子节点就是其中一种:
MATCH p = (Main:Node {id: 'main'})
-[:child*]->(T:Node)<-[:child*]-
(Other:Node {id: 'other'})
WITH T,
collect(p) as pw WHERE size(pw) = 1
RETURN T发布于 2017-12-08 21:51:16
此查询收集两个实体的所有直接后代,然后筛选出具有直接后代作为父级的实体:
MATCH (:Node {name : "Main"})-[:child]->(child:Node)<-[:child]-(:Node {name : "Other"})
WITH COLLECT(child) AS children
UNWIND children AS c
MATCH (c)<-[:child]-(parent:Node)
WITH c, children, COLLECT(parent) AS parents
WHERE NONE(p IN parents WHERE p IN children)
RETURN c;https://stackoverflow.com/questions/47716982
复制相似问题