graphDB对于这种特定类型的图形相关查询将表现最好？ Neo4j的？ flockdb？

问题描述

我有一个大的非循环有向图。

每个节点都有一些键/值对。

假设所有节点都有这些键：

• color - 红色，蓝色，绿色等。


• price - 一个整数


• 大小 - 一个整数





我想从我的图表中选择一个节点列表，以便：





• 所有节点都有color = red


• 所有节点的价格> = 10且
  
• size


• 任何符合颜色和价格标准的节点并且没有outlink（节点中没有 节点）位于列表中


• 列表中没有两个节点共享一个边
  




理想情况下，列表中可能有最大数量的节点以满足所有这些约束。





我需要能够快速搜索此图。





什么样数据存储（图形或其他）最适合这个问题？有关如何实现模式和查询以获得最佳性能的任何提示？

解决方案

您对此有任何大小估计吗？这将提供更多关于如何执行计算的提示 - 在内存或索引或惰性图形加载中。 / peter neubauer




I have a large, non-cyclic directed graph.

Every node has some key/value pairs. Some of the keys can be searched by range.

Let's say all nodes have these keys:

• color - red, blue, green, etc.
• price - an integer
• size - an integer

I want to select a list of nodes from my graph such that:

• all nodes have color = red
• all nodes have price >= 10 and <= 20
• the list is ordered by increasing size
• any node that meets the criteria for color and price and has no outlinks (no edges go from that node) is in the list
• no two nodes in the list share an edge

Ideally, the list would have the maximum number of nodes possibly to satisfy all those constraints.

I need to be able to search this graph very quickly.

What kind of data store (graph or otherwise) is best suited for this problem? Any hints on how to implement schema and query to get the best performance?

解决方案

Do you have any size estimations on this? That would give some more hints on how you can do the computations - in memory or index or lazy graph loading. /peter neubauer

这篇关于graphDB对于这种特定类型的图形相关查询将表现最好？ Neo4j的？ flockdb？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！