NeddySpaghetti
NeddySpaghetti

Reputation: 13495

Fast in-memory graph database

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.

Upvotes: 1

Views: 4201

Answers (2)

KWriter
KWriter

Reputation: 1180

Memgraph is an in-memory graph database, and it has support for C#.

Upvotes: 0

Vidar Langberget
Vidar Langberget

Reputation: 457

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.

Upvotes: 2

Related Questions