DBMS > DataFS vs. JanusGraph vs. KeyDB vs. Oracle

System Properties Comparison DataFS vs. JanusGraph vs. KeyDB vs. Oracle

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

All data is stored inside objects which are linked by so-called link attributes. Objects consist of classes which can be extended and de-extended at runtime. Graphs can be defined with a struct.

A Graph DBMS optimized for distributed clusters

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

An ultra-fast, open source Key-value store fully compatible with Redis API, modules, and protocols

Widely used RDBMS

Primary database model

Secondary database models

Graph DBMS

Document store
Graph DBMS

with Oracle Spatial and Graph
RDF store

with Oracle Spatial and Graph
Spatial DBMS

with Oracle Spatial and Graph
Vector DBMS

since Oracle 23

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

Score	0.09
Rank	#360	Overall
	#17	Object oriented DBMS

Score	2.02
Rank	#125	Overall
	#12	Graph DBMS

Score	0.70
Rank	#229	Overall
	#32	Key-value stores

Score	1244.08
Rank	#1	Overall
	#1	Relational DBMS

Website

newdatabase.com

janusgraph.org

github.com/Snapchat/KeyDB
keydb.dev

www.oracle.com/database

Technical documentation

dev.mobiland.com/Overview.xsp

docs.janusgraph.org

docs.keydb.dev

docs.oracle.com/en/database

Developer

Mobiland AG

Linux Foundation; originally developed as Titan by Aurelius

EQ Alpha Technology Ltd.

Oracle

Initial release

2018

2017

2019

1980

Current release

1.1.263, October 2022

0.6.3, February 2023

23c, September 2023

License

Commercial or Open Source

commercial

Open Source

Apache 2.0

Open Source

BSD-3

commercial

restricted free version is available

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++

C and C++

Server operating systems

Windows

Linux
OS X
Unix
Windows

Linux

AIX
HP-UX
Linux
OS X
Solaris
Windows
z/OS

Data scheme

Classes, Structs, and Lists are written in proprietary DataTypeDefinitionLanguage (.dtdl) and Objects consisting of those are written in proprietary DataAccessDefinitionLanguage (.dadl)

yes

schema-free

yes

Schemaless in JSON and XML columns

Typing

predefined data types such as float or date

yes

partial

Supported data types are strings, hashes, lists, sets and sorted sets, bit arrays, hyperloglogs and geospatial indexes

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

by using the Redis Search module

yes

SQL

Support of SQL

yes

with proprietary extensions

APIs and other access methods

.NET Client API
Proprietary client DLL
WinRT client

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Proprietary protocol

RESP - REdis Serialization Protoco

JDBC
ODBC
ODP.NET
Oracle Call Interface (OCI)

Supported programming languages

.Net
C
C#
C++
VB.Net

Clojure
Java
Python

C
C#
C++
Clojure
Crystal
D
Dart
Elixir
Erlang
Fancy
Go
Haskell
Haxe
Java
JavaScript (Node.js)
Lisp
Lua
MatLab
Objective-C
OCaml
Pascal
Perl
PHP
Prolog
Pure Data
Python
R
Rebol
Ruby
Rust
Scala
Scheme
Smalltalk
Swift
Tcl
Visual Basic

C
C#
C++
Clojure
Cobol
Delphi
Eiffel
Erlang
Fortran
Groovy
Haskell
Java
JavaScript
Lisp
Objective C
OCaml
Perl
PHP
Python
R
Ruby
Scala
Tcl
Visual Basic

Server-side scripts

Stored procedures

yes

Lua

PL/SQL

also stored procedures in Java possible

Triggers

no, except callback-events from server when changes happened

yes

Partitioning methods

Methods for storing different data on different nodes

Proprietary Sharding system

yes

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

Sharding

Sharding, horizontal partitioning

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Multi-source replication
Source-replica replication

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

can be realized in PL/SQL

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency

Eventual Consistency
Immediate Consistency

Eventual Consistency
Strong eventual consistency with CRDTs

Immediate Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

Transaction concepts

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

ACID

Optimistic locking, atomic execution of commands blocks and scripts

ACID

isolation level can be parameterized

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

Configurable mechanisms for persistency via snapshots and/or operations logs

yes

In-memory capabilities

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

yes

Version 12c introduced the new option 'Oracle Database In-Memory'

User concepts

Access control

Windows-Profile

User authentification and security via Rexster Graph Server

simple password-based access control and ACL

fine grained access rights according to SQL-standard

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.