DBMS > JanusGraph vs. OpenSearch vs. RethinkDB vs. SwayDB

System Properties Comparison JanusGraph vs. OpenSearch vs. RethinkDB vs. SwayDB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A Graph DBMS optimized for distributed clusters

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

A distributed, RESTful search and analytics engine forked from Elasticsearch and based on Apache Lucene

DBMS for the Web with a mechanism to push updated query results to applications in realtime.

An embeddable, non-blocking, type-safe key-value store for single or multiple disks and in-memory storage

Primary database model

Secondary database models

Vector DBMS

Spatial DBMS

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

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	2.74
Rank	#105	Overall
	#19	Document stores

Score	0.00
Rank	#382	Overall
	#59	Key-value stores

Website

janusgraph.org

github.com/opensearch-project
opensearch.org

rethinkdb.com

swaydb.simer.au

Technical documentation

docs.janusgraph.org

opensearch.org/docs/latest

rethinkdb.com/docs

Developer

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

The Linux Foundation

since July 2017

Simer Plaha

Initial release

2017

2021

2009

2018

Current release

0.6.3, February 2023

2.5.0, January 2023

2.4.1, August 2020

License

Commercial or Open Source

Open Source

Apache 2.0

Open Source

Apache Version 2.0

Open Source

Apache Version 2

Open Source

GNU Affero GPL V3.0

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.

Aiven for OpenSearch: Fully managed open source search and analytics suite. Out-of-the-box integrations get you up and running in a couple of clicks.

Implementation language

Java

C++

Scala

Server operating systems

Linux
OS X
Unix
Windows

All OS with a Java VM

Linux
OS X
Windows

Data scheme

yes

schema-free

Flexible type definitions. Once a type is defined, it is persistent

schema-free

Typing

predefined data types such as float or date

yes

string, binary, float, bool, date, geometry

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.

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

APIs and other access methods

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Supported programming languages

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

community-supported driver
C#

community-supported driver
C++

community-supported driver
Clojure

community-supported driver
Dart

community-supported driver
Erlang

community-supported driver
Go

community-supported driver
Haskell

community-supported driver
Java

official driver
JavaScript (Node.js)

official driver
Lisp

community-supported driver
Lua

community-supported driver
Objective-C

community-supported driver
Perl

community-supported driver
PHP

community-supported driver
Python

official driver
Ruby

official driver
Scala

community-supported driver

Java
Kotlin
Scala

Server-side scripts

Stored procedures

yes

Triggers

yes

by using the 'percolation' feature

Client-side triggers through changefeeds

Partitioning methods

Methods for storing different data on different nodes

yes

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

Sharding

range based

none

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Source-replica replication

none

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

Eventual Consistency

Synchronous doc based replication. Get by ID may show delays up to 1 sec. Configurable write consistency: one, quorum, all

Immediate Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

Transaction concepts

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

ACID

Atomic single-document operations

Atomic execution of operations

Concurrency

Support for concurrent manipulation of data

yes

MVCC based

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

User authentification and security via Rexster Graph Server

yes

users and table-level permissions

More information provided by the system vendor

Specific characteristics

OpenSearch is a highly scalable and extensible open-source software suite for search,...
» more

Competitive advantages

Distributed as fully open source under Apache License, Version 2.0 (ALv2), OpenSearch...
» more

Typical application scenarios

The OpenSearch platform is used across a broad range of search , analytics, and observability...
» more

Licensing and pricing models

The OpenSearch Project offers open source software licensed under Apache License...
» more

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.