graph-databases

What .NET-compatible graph database solution(s) have a proven track record?

by

Trying to implement a graph database in Mongo is a rabbit hole that’s been tried before. See this message from the TinkerPop user group: https://groups.google.com/d/msg/gremlin-users/_zweYGxR8wM/0AUu-UoqTRIJ Microsoft’s Trinity graph is an internal project not available for download: http://research.microsoft.com/en-us/projects/trinity/ Neo4j Server (http://neo4j.org) paired with Romiko and Tatham’s .NET client (http://hg.readify.net/neo4jclient/wiki/Home) is a popular combination. Neo4j scales to … Read more

A graph DB vs a Prolog (or miniKanren)

by

No, logic programming as embodied by those things and neo4j are quite different. On one level, you’re right that they conceptually both amount to graph storage and graph query. But for logic programming, it’s only conceptually graph query, there’s no guarantee that it’s actually stored that way (where with neo4j, it is). Second, with logic … Read more

Gremlin remove all Vertex

by

In more recent terms as of Gremlin 2.3.0, removal of all vertices would be best accomplished with: g.V.remove() UPDATE: For version Gremlin 3.x you would use drop(): gremlin> graph = TinkerFactory.createModern() ==>tinkergraph[vertices:6 edges:6] gremlin> g = graph.traversal() ==>graphtraversalsource[tinkergraph[vertices:6 edges:6], standard] gremlin> g.V().drop().iterate() gremlin> graph ==>tinkergraph[vertices:0 edges:0] Note that drop() does not automatically iterate the Traversal … Read more

What is the difference between graph-based databases and object-oriented databases?

by

I’d answer this differently: object and graph databases operate on two different levels of abstraction. An object database’s main data elements are objects, the way we know them from an object-oriented programming language. A graph database’s main data elements are nodes and edges. An object database does not have the notion of a (bidirectional) edge … Read more

techhipbettruvabetnorabahisbahis forumu