快速内存图数据库 [英] Fast in-memory graph database

查看:95
本文介绍了快速内存图数据库的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

有人知道那里有一个好的解决方案,可以处理互连节点的图吗?为了我们的目的,节点是位置,我们在这些位置之间移动具有各种属性的材质.在某个时候,用户可能需要查询特定位置的物料,物料的来源等.我需要做的是走动图表/树并根据用户的需求对数量进行汇总.

我当时在考虑使用内存中的图形数据库,或者图形库可能适合此类问题,但我不是100%肯定的.需要从c#4.5中调用它.

我读到有关Microsoft的 Trinity ,并且还有 Neo4j ,但我对其中任何一个都没有任何经验.

解决方案

至少有两个内存中的c#替代方法:

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

OrigoDB- https://origodb.com/作者刚刚在邮件列表中提到他正在工作在一个图形示例中.

我们正在使用VelocityGraph满足我们的图形需求- http://www.velocitygraph.com/

但是VelocityGraph并不是内存中的解决方案,因此我不确定它是否适合您的需求.

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.

解决方案

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

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

OrigoDB - https://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.

这篇关于快速内存图数据库的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆