Another Word For It Patrick Durusau on Topic Maps and Semantic Diversity

September 13, 2013

An empirical comparison of graph databases

Filed under: Benchmarks,DEX,Graphs,Neo4j,OrientDB,Titan — Patrick Durusau @ 2:39 pm

An empirical comparison of graph databases by Salim Jouili and Valentin Vansteenberghe.

Abstract:

In recent years, more and more companies provide services that can not be anymore achieved efficiently using relational databases. As such, these companies are forced to use alternative database models such as XML databases, object-oriented databases, document-oriented databases and, more recently graph databases. Graph databases only exist for a few years. Although there have been some comparison attempts, they are mostly focused on certain aspects only.

In this paper, we present a distributed graph database comparison framework and the results we obtained by comparing four important players in the graph databases market: Neo4j, OrientDB, Titan and DEX.

(Salim Jouili and Valentin Vansteenberghe, An empirical comparison of graph databases. To appear in Proceedings of the 2013 ASE/IEEE International Conference on Big Data, Washington D.C., USA, September 2013.)

For your convenience:

DEX

Neo4j

OrientDB

Titan

I won’t reproduce the comparison graphs here. The “winner” depends on your requirements.

Looking forward to seeing this graph benchmark develop!

January 20, 2013

A Comparison of 7 Graph Databases

Filed under: AllegroGraph,DEX,FlockDB,InfiniteGraph,Neo4j,OrientDB — Patrick Durusau @ 8:02 pm

A Comparison of 7 Graph Databases by Alex Popescu.

Alex links to a graphic from InfiniteGraph that compares Infinite Graph, Neo4j, AllegroGraph, Titan, FlockDB, Dex and OrientDB.

The graphic is nearly unreadable so Alex embeds and points to a GoogleDoc spreadsheet by Peter Karussell that you will find easier to view.

Thanks Alex and Peter!

November 7, 2012

Gephi Blueprints plugin

Filed under: Blueprints,DEX,FluxGraph,Gephi,Gephi Blueprints,Graphs,Neo4j,OrientDB,RexterGraph,TinkerGraph — Patrick Durusau @ 1:54 pm

Gephi Blueprints plugin by David Suvee.

From the homepage:

The Gephi Blueprints plugin allows a user to import graph-data from any graph database that implements the Tinkerpop Blueprints generic graph API. Out of the box, the plugin provides support for TinkerGraph, Neo4j, OrientDB, Dex and RexterGraph. Additionally, it also provides support for the FluxGraph temporal graph database.

Excellent!

Not to mention having a short list of interesting graph software to boot!

June 23, 2012

DEX 4.6 Released!

Filed under: DEX,Graphs — Patrick Durusau @ 3:57 pm

DEX 4.6 Released!

Features:

DEX 4.6 makes DEX aCiD.

  • Durability: Changes will persist thanks to the complete Recovery Manager. The recovery manager keeps your DEX databases automatically backedup all the time, and provides recovery tools in case you may need to delete unfinished Tx.
  • Consistency: After each Tx the GBD is consistent, guaranteed with the operations order.
  • Atomicity: Better autocommitted transactions (not rollback yet).
  • Isolation: Simple isolated Tx with S/X blocking.

(From the release page.)

Useful links:

Downloads

Documentation, including a new “Getting Started.”

Using TEXT attribute (NEW 4.6 interface!) – Java

I appreciated the “Getting Started” document offering the example application in Java, C# and C++.

On the other hand, it is a bit “lite” in terms of examples.

So I looked at the Technical Documentation because it was described as:

Complete technical documentation of the API, with examples of use, in pdf and html formats.

So, searching on the term “example” (in the pdf JavaDoc documentation for DEX 4.6) I find:

  • com.sparsity.dex.gdb.Condition – regex examples
  • com.sparsity.dex.gdb.Objects – “example”
  • com.sparsity.dex.gdb.Session – “example” While I am here, correction: “Objects or Values instances or even session attributes are an example of temporary data.” -> Objects, values instances, and session attributes are examples of temporary data.
  • com.sparsity.dex.io.CSVReader – “example”
  • com.sparsity.dex.script.ScriptParser – one line examples from pp. 268-270

Having said all that, the documentation isn’t a reason to avoid DEX.

I am going to throw a copy on my Ubuntu box before the end of the month.

March 16, 2012

Dex 4.5 release

Filed under: DEX,Graphs — Patrick Durusau @ 7:36 pm

Dex 4.5 release

From the webpage:

DEX 4.5 includes the following new features:

  • Graph Algorithm package for all APIs
  • Graph Algorithm package includes the following algorithms:
    • Traversals algorithms: To traverse the graph using DFS or BFS techniques. Your choice!
    • Find shortest path algorithms: Find the shortest way to between two nodes, using BFS or Dijkstra techniques, whatever fits your code best!.
    • Connected components algorithms: Find Strongy or Weakly connected components

I was tipped off to this release by Alex Popescu’s myNoSQL.

December 2, 2011

DEX 4.3 Graph Database

Filed under: DEX,Graphs — Patrick Durusau @ 4:53 pm

DEX 4.3 Graph Database

Sparsity Technologies has released DEX 4.3!

From the products page:

DEX 4.3 is distributed in 3 different APIs:

  • JAVA: Java API for DEX. We have remodelled the Java API for a better structured future of DEX.
    New feature – DEX Java 4.3 includes loaders and exporters for edges and nodes
    Allows creating a graph and manipulate its schema using a script. Load nodes and edges direclty from a csv file
    Take into account that currently this API is not offering graph algorithms, they will be up in the next release.
  • .NET: The .NET API makes possible to Microsoft .NET programmers to use the high performance of DEX graph database.
    New feature – DEX.NET 4.3 includes loaders and exporters for edges and nodes
    Allows creating a graph and manipulate its schema using a script. Load nodes and edges direclty from a csv file
    Take into account that currently this API is not offering graph algorithms, they will be up in the next release.
  • JDEX: For a complete compatibility with applications from previous versions of DEX, we are keeping the Jdex API.

I checked with Sparsity and the statement about the graph algorithms should read:

The graph algorithms (DFS, BFS and Shortest Path) present in JDEX API since v3.0 are not yet included in the new APIs JAVA and .NET, released since v.4.2 and following. The v.4.5 release, planned for 1st quarter of 2012 will include these algorithms in the JAVA and .NET APIs.

Evaluation version only goes up to 1 million nodes so you will have to use something else for your season’s wish list. 😉

Powered by WordPress