图数据库两个节点只有在两者都为真时才与另一个节点有关系
[英]Graph database two nodes have a relationship with another node ONLY if both are true
问题描述
like this: https://i.imgur.com/MrA6zQP.png
像这样： https : //i.imgur.com/MrA6zQP.png
A and B are related to C but ONLY if both A and B are true. A 和 B 与 C 相关，但前提是 A 和 B 都为真。
I'm currently using Neo4J as my graph database, but I'm not sure it has this capability.我目前使用 Neo4J 作为我的图形数据库，但我不确定它是否具有此功能。 I'd be open to switching to a different graph database if it meant that the free version had this capability.如果免费版本具有此功能，我愿意切换到不同的图形数据库。
1 个解决方案
解决方案1
1 2020-11-08 19:30:13
In Neo4j (and any other graph database I guess) a relation exists or does not exist.在 Neo4j（以及我猜的任何其他图形数据库）中，存在或不存在关系。 As long as we're not using quantum computing, it's binary.只要我们不使用量子计算，它就是二进制的。 But, you can definitely retrieve paths, or create/project virtual graphs based on conditions, which could include the one you mention.但是，您绝对可以根据条件检索路径或创建/投影虚拟图，其中可能包括您提到的那个。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.