DBMS > ArcadeDB vs. BigObject vs. JanusGraph vs. OpenSearch

System Properties Comparison ArcadeDB vs. BigObject vs. JanusGraph vs. OpenSearch

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Fast and scalable multi-model DBMS, originally forked from OrientDB but most of the code has been rewritten

Analytic DBMS for real-time computations and queries

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

Primary database model

Document store
Graph DBMS
Key-value store
Time Series DBMS

in next version

Relational DBMS

a hierachical model (tree) can be imposed

Graph DBMS

Search engine

Secondary database models

Vector DBMS

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

Score	0.02
Rank	#366	Overall
	#50	Document stores
	#38	Graph DBMS
	#53	Key-value stores
	#36	Time Series DBMS

Score	0.13
Rank	#333	Overall
	#147	Relational DBMS

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Website

arcadedb.com

bigobject.io

janusgraph.org

github.com/opensearch-project
opensearch.org

Technical documentation

docs.arcadedb.com

docs.bigobject.io

docs.janusgraph.org

opensearch.org/docs/latest

Developer

Arcade Data

BigObject, Inc.

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

Initial release

2021

2015

2017

2021

Current release

September 2021

0.6.3, February 2023

2.5.0, January 2023

License

Commercial or Open Source

Open Source

Apache Version 2.0

commercial

free community edition available

Open Source

Apache 2.0

Open Source

Apache Version 2.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.

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

Server operating systems

All OS with a Java VM

Linux

distributed as a docker-image
OS X

distributed as a docker-image (boot2docker)
Windows

distributed as a docker-image (boot2docker)

Linux
OS X
Unix
Windows

All OS with a Java VM

Data scheme

schema-free

yes

schema-free

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

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

All search fields are automatically indexed

SQL

Support of SQL

SQL-like query language, no joins

SQL-like DML and DDL statements

SQL-like query language

APIs and other access methods

JDBC
MongoDB API
OpenCypher
PostgreSQL wire protocol
Redis API
RESTful HTTP/JSON API
TinkerPop Gremlin

fluentd
ODBC
RESTful HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Supported programming languages

Java

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Server-side scripts

Stored procedures

Lua

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

none

yes

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

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

Source-replica replication

none

yes

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency

none

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

relationship in graphs

yes

automatically between fact table and dimension tables

yes

Relationships in graphs

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

yes

Read/write lock on objects (tables, trees)

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

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.