DBMS > BigchainDB vs. Hazelcast vs. OpenSearch vs. PlanetScale vs. Trafodion

System Properties Comparison BigchainDB vs. Hazelcast vs. OpenSearch vs. PlanetScale vs. Trafodion

Editorial information provided by DB-Engines

Name

Apache Trafodion has been retired in 2021. Therefore it is excluded from the DB-Engines Ranking.

Description

BigchainDB is scalable blockchain database offering decentralization, immutability and native assets

A widely adopted in-memory data grid

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

Scalable, distributed, serverless MySQL database platform built on top of Vitess

Transactional SQL-on-Hadoop DBMS

Primary database model

Secondary database models

Document store

JSON support with IMDG 3.12

Vector DBMS

Document store
Spatial DBMS

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

Score	0.85
Rank	#208	Overall
	#35	Document stores

Score	5.46
Rank	#61	Overall
	#7	Key-value stores

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	1.49
Rank	#155	Overall
	#72	Relational DBMS

Website

www.bigchaindb.com

hazelcast.com

github.com/opensearch-project
opensearch.org

planetscale.com

trafodion.apache.org

Technical documentation

bigchaindb.readthedocs.io/en/latest

hazelcast.org/imdg/docs

opensearch.org/docs/latest

planetscale.com/docs

trafodion.apache.org/documentation.html

Developer

Hazelcast

Amazon Web Services

PlanetScale

Apache Software Foundation, originally developed by HP

Initial release

2016

2008

2021

2020

2014

Current release

5.3.6, November 2023

2.5.0, January 2023

2.3.0, February 2019

License

Commercial or Open Source

Open Source

AGPL v3

Open Source

Apache Version 2; commercial licenses available

Open Source

Apache Version 2.0

commercial

Open Source

Apache 2.0

Cloud-based only

Only available as a cloud service

yes

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

Python

Java

C++, Java

Server operating systems

Linux

All OS with a Java VM

Docker
Linux
macOS

Linux

Data scheme

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.

yes

the object must implement a serialization strategy

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

with proprietary extensions

yes

APIs and other access methods

CLI Client
RESTful HTTP API

JCache
JPA
Memcached protocol
RESTful HTTP API

Java API
RESTful HTTP/JSON API

ADO.NET
JDBC
MySQL protocol
ODBC

ADO.NET
JDBC
ODBC

Supported programming languages

Go
Haskell
Java
JavaScript
Python
Ruby

.Net
C#
C++
Clojure
Go
Java
JavaScript (Node.js)
Python
Scala

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Ada
C
C#
C++
D
Delphi
Eiffel
Erlang
Haskell
Java
JavaScript (Node.js)
Objective-C
OCaml
Perl
PHP
Python
Ruby
Scheme
Tcl

All languages supporting JDBC/ODBC/ADO.Net

Server-side scripts

Stored procedures

yes

Event Listeners, Executor Services

yes

proprietary syntax

Java Stored Procedures

Triggers

yes

Events

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

selectable replication factor

yes

Replicated Map

yes

Multi-source replication
Source-replica replication

yes, via HBase

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via user defined functions and HBase

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency or Eventual Consistency selectable by user

Raft Consensus Algorithm

Eventual Consistency

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

Eventual Consistency across shards
Immediate Consistency within a shard

Immediate Consistency

Foreign keys

Referential integrity

yes

not for MyISAM storage engine

yes

Transaction concepts

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

one or two-phase-commit; repeatable reads; read commited

ACID at shard level

ACID

Concurrency

Support for concurrent manipulation of data

yes

table locks or row locks depending on storage engine

yes

Durability

Support for making data persistent

yes,with MongoDB ord RethinkDB

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

yes

Role-based access control

Users with fine-grained authorization concept

no user groups or roles

fine grained access rights according to SQL-standard

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.