DBMS > Graph Engine vs. JanusGraph vs. MySQL vs. Riak KV

System Properties Comparison Graph Engine vs. JanusGraph vs. MySQL vs. Riak KV

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A distributed in-memory data processing engine, underpinned by a strongly-typed RAM store and a general distributed computation engine

A Graph DBMS optimized for distributed clusters

It was forked from the latest code base of Titan in January 2017

Widely used open source RDBMS

Distributed, fault tolerant key-value store

Primary database model

Graph DBMS
Key-value store

Graph DBMS

Relational DBMS

Key/Value like access via memcached API

Key-value store

with links between data sets and object tags for the creation of secondary indexes

Secondary database models

Document store
Spatial DBMS

DB-Engines Ranking measures the popularity of database management systems
Trend Chart

Score	0.56
Rank	#241	Overall
	#21	Graph DBMS
	#34	Key-value stores

Score	1.85
Rank	#134	Overall
	#12	Graph DBMS

Score	1029.49
Rank	#2	Overall
	#2	Relational DBMS

Score	3.84
Rank	#76	Overall
	#9	Key-value stores

Website

www.graphengine.io

janusgraph.org

www.mysql.com

Technical documentation

www.graphengine.io/docs/manual

docs.janusgraph.org

dev.mysql.com/doc

www.tiot.jp/riak-docs/riak/kv/latest

Developer

Microsoft

Linux Foundation; originally developed as Titan by Aurelius

Oracle

since 2010, originally MySQL AB, then Sun

OpenSource, formerly Basho Technologies

Initial release

2010

2017

1995

2009

Current release

1.0.0, October 2023

9.0.0, July 2024

3.2.0, December 2022

License

Commercial or Open Source

Open Source

MIT License

Open Source

Apache 2.0

Open Source

GPL version 2. Commercial licenses with extended functionallity are available

Open Source

Apache version 2, commercial enterprise edition

Cloud-based only

Only available as a cloud service

DBaaS offerings (sponsored links)

Database as a Service

Providers of DBaaS offerings, please contact us to be listed.

Implementation language

.NET and C

Java

C and C++

Erlang

Server operating systems

.NET

Linux
OS X
Unix
Windows

FreeBSD
Linux
OS X
Solaris
Windows

Linux
OS X

Data scheme

yes

schema-free

Typing

predefined data types such as float or date

yes

XML support

Some form of processing data in XML format, e.g. support for XML data structures, and/or support for XPath, XQuery or XSLT.

yes

Secondary indexes

yes

restricted

SQL

Support of SQL

yes

with proprietary extensions

APIs and other access methods

RESTful HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

ADO.NET
JDBC
ODBC
Proprietary native API

HTTP API
Native Erlang Interface

Supported programming languages

C#
C++
F#
Visual Basic

Clojure
Java
Python

Ada
C
C#
C++
D
Delphi
Eiffel
Erlang
Haskell
Java
JavaScript (Node.js)
Objective-C
OCaml
Perl
PHP
Python
Ruby
Scheme
Tcl

unofficial client library
C#
C++

unofficial client library
Clojure

unofficial client library
Dart

unofficial client library
Erlang
Go

unofficial client library
Groovy

unofficial client library
Haskell

unofficial client library
Java
JavaScript

unofficial client library
Lisp

unofficial client library
Perl

unofficial client library
PHP
Python
Ruby
Scala

unofficial client library
Smalltalk

unofficial client library

Server-side scripts

Stored procedures

yes

proprietary syntax

Erlang

Triggers

yes

pre-commit hooks and post-commit hooks

Partitioning methods

Methods for storing different data on different nodes

horizontal partitioning

yes

depending on the used storage backend (e.g. Cassandra, HBase, BerkeleyDB)

horizontal partitioning, sharding with MySQL Cluster or MySQL Fabric

Sharding

no "single point of failure"

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Multi-source replication
Source-replica replication

selectable replication factor

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Immediate Consistency

Immediate Consistency

Eventual Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

not for MyISAM storage engine

links between data sets can be stored

Transaction concepts

Support to ensure data integrity after non-atomic manipulations of data

ACID

not for MyISAM storage engine

Concurrency

Support for concurrent manipulation of data

yes

table locks or row locks depending on storage engine

yes

Durability

Support for making data persistent

optional: either by committing a write-ahead log (WAL) to the local persistent storage or by dumping the memory to a persistent storage

yes

Supports various storage backends: Cassandra, HBase, Berkeley DB, Akiban, Hazelcast

yes

In-memory capabilities

Is there an option to define some or all structures to be held in-memory only.

yes

User concepts

Access control

User authentification and security via Rexster Graph Server

Users with fine-grained authorization concept

no user groups or roles

yes, using Riak Security

More information provided by the system vendor

We invite representatives of system vendors to contact us for updating and extending the system information,
and for displaying vendor-provided information such as key customers, competitive advantages and market metrics.