Fast in-memory graph database

五迷三道 提交于 2021-01-28 03:54:30

问题


Does anyone know of a good solution out there that can deal with processing a graph of interconnected nodes? For our purpose the nodes are locations and we move material with various attributes between these locations. At some point a user may need to query what material is at a particular location, where it came from etc. What I need to do is walk the graph/tree and sum up quantities along the way depending on what a user requests.

I was thinking an in-memory graph database or alternatively a graph library may be suitable for this kind of problem but I am not 100% sure. It needs to be called from c# 4.5.

I read about Microsoft's Trinity and there is also Neo4j but I haven had any experience with any of them.


回答1:


There are at least two in-memory c# alternatives:

Fallen-8 - http://www.fallen-8.com/

OrigoDB - http://dev.origodb.com/ The author just mentioned in a mailing list that he was working on a graph example.

We're using VelocityGraph for our graph needs - http://www.velocitygraph.com/

But VelocityGraph not an in-memory solution, so I'm not sure how it suits your requirements.



来源:https://stackoverflow.com/questions/27957730/fast-in-memory-graph-database

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!