DBMS > Dgraph vs. JanusGraph vs. Microsoft SQL Server vs. Riak KV

System Properties Comparison Dgraph vs. JanusGraph vs. Microsoft SQL Server vs. Riak KV

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Distributed and scalable native Graph DBMS

A Graph DBMS optimized for distributed clusters

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

Microsofts flagship relational DBMS

Distributed, fault tolerant key-value store

Primary database model

Graph DBMS

Relational DBMS

Key-value store

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

Secondary database models

Document store
Graph DBMS
Spatial DBMS

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

Score	1.45
Rank	#156	Overall
	#15	Graph DBMS

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	824.29
Rank	#3	Overall
	#3	Relational DBMS

Score	4.10
Rank	#82	Overall
	#9	Key-value stores

Website

dgraph.io

janusgraph.org

www.microsoft.com/en-us/sql-server

Technical documentation

dgraph.io/docs

docs.janusgraph.org

learn.microsoft.com/en-US/sql/sql-server

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

Developer

Dgraph Labs, Inc.

Linux Foundation; originally developed as Titan by Aurelius

Microsoft

OpenSource, formerly Basho Technologies

Initial release

2016

2017

1989

2009

Current release

0.6.3, February 2023

SQL Server 2022, November 2022

3.2.0, December 2022

License

Commercial or Open Source

Open Source

Apache 2.0

Open Source

Apache 2.0

commercial

restricted free version is 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

Java

C++

Erlang

Server operating systems

Linux
OS X
Windows

Linux
OS X
Unix
Windows

Linux
Windows

Linux
OS X

Data scheme

schema-free

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

APIs and other access methods

GraphQL query language
gRPC (using protocol buffers) API
HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

ADO.NET
JDBC
ODBC
OLE DB
Tabular Data Stream (TDS)

HTTP API
Native Erlang Interface

Supported programming languages

C#
C++
Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Clojure
Java
Python

C#
C++
Delphi
Go
Java
JavaScript (Node.js)
PHP
Python
R
Ruby
Visual Basic

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

Transact SQL, .NET languages, R, Python and (with SQL Server 2019) Java

Erlang

Triggers

yes

pre-commit hooks and post-commit hooks

Partitioning methods

Methods for storing different data on different nodes

yes

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

tables can be distributed across several files (horizontal partitioning); sharding through federation

Sharding

no "single point of failure"

Replication methods

Methods for redundantly storing data on multiple nodes

Synchronous replication via Raft

yes

yes, but depending on the SQL-Server Edition

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

Immediate Consistency

Eventual Consistency
Immediate Consistency

Immediate Consistency

Eventual Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

links between data sets can be stored

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

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

Planned for future releases

User authentification and security via Rexster Graph Server

fine grained access rights according to SQL-standard

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.