DBMS > HugeGraph vs. JanusGraph vs. OpenSearch vs. VoltDB

System Properties Comparison HugeGraph vs. JanusGraph vs. OpenSearch vs. VoltDB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A fast-speed and highly-scalable Graph DBMS

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

Distributed In-Memory NewSQL RDBMS

Used for OLTP applications with a high frequency of relatively simple transactions, that can hold all their data in memory

Primary database model

Graph DBMS

Search engine

Relational DBMS

Secondary database models

Vector DBMS

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

Score	0.17
Rank	#335	Overall
	#31	Graph DBMS

Score	2.02
Rank	#125	Overall
	#12	Graph DBMS

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	1.47
Rank	#157	Overall
	#73	Relational DBMS

Website

github.com/hugegraph
hugegraph.apache.org

janusgraph.org

github.com/opensearch-project
opensearch.org

www.voltdb.com

Technical documentation

hugegraph.apache.org/docs

docs.janusgraph.org

opensearch.org/docs/latest

docs.voltdb.com

Developer

Baidu

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

VoltDB Inc.

Initial release

2018

2017

2021

2010

Current release

0.9

0.6.3, February 2023

2.5.0, January 2023

11.3, April 2022

License

Commercial or Open Source

Open Source

Apache Version 2.0

Open Source

Apache 2.0

Open Source

Apache Version 2.0

Open Source

AGPL for Community Edition, commercial license for Enterprise, AWS, and Pro Editions

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.

STACKIT OpenSearch offers OpenSearch in a managed version in enterprise grade, 100% GDPR-compliant, for a wide range of applications like analytics, website search, offering scalability and fast data access.
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

Java, C++

Server operating systems

Linux
macOS
Unix

Linux
OS X
Unix
Windows

All OS with a Java VM

Linux
OS X

for development

Data scheme

yes

schema-free

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

yes

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.

Secondary indexes

yes

also supports composite index and range index

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

only a subset of SQL 99

APIs and other access methods

Java API
RESTful HTTP API
TinkerPop Gremlin

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Java API
JDBC
RESTful HTTP/JSON API

Supported programming languages

Groovy
Java
Python

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C#
C++
Erlang

not officially supported
Go
Java
JavaScript

Node.js
PHP
Python

Server-side scripts

Stored procedures

asynchronous Gremlin script jobs

yes

Java

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

yes

depending on used storage backend, e.g. Cassandra and HBase

yes

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

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

yes

depending on used storage backend, e.g. Cassandra and HBase

yes

Multi-source replication
Source-replica replication

MapReduce

Offers an API for user-defined Map/Reduce methods

via hugegraph-spark

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency

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

Foreign keys

Referential integrity

yes

edges in graph

yes

Relationships in graphs

FOREIGN KEY constraints are not supported

Transaction concepts

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

ACID

Transactions are executed single-threaded within stored procedures

Concurrency

Support for concurrent manipulation of data

yes

Data access is serialized by the server

Durability

Support for making data persistent

yes

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

yes

Snapshots and command logging

In-memory capabilities

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

yes

User concepts

Access control

Users, roles and permissions

User authentification and security via Rexster Graph Server

Users and roles with access to stored procedures

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.