DBMS > AnzoGraph DB vs. Hazelcast vs. OpenSearch vs. TerarkDB

System Properties Comparison AnzoGraph DB vs. Hazelcast vs. OpenSearch vs. TerarkDB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Scalable graph database built for online analytics and data harmonization with MPP scaling, high-performance analytical algorithms and reasoning, and virtualization

A widely adopted in-memory data grid

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

A key-value store forked from RocksDB with advanced compression algorithms. It can be used standalone or as a storage engine for MySQL and MongoDB

Primary database model

Secondary database models

Document store

JSON support with IMDG 3.12

Vector DBMS

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

Score	0.29
Rank	#303	Overall
	#25	Graph DBMS
	#14	RDF stores

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

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	0.08
Rank	#367	Overall
	#56	Key-value stores

Website

cambridgesemantics.com/anzograph

hazelcast.com

github.com/opensearch-project
opensearch.org

github.com/bytedance/terarkdb

Technical documentation

docs.cambridgesemantics.com/anzograph/userdoc/home.htm

hazelcast.org/imdg/docs

opensearch.org/docs/latest

bytedance.larkoffice.com/docs/doccnZmYFqHBm06BbvYgjsHHcKc

Developer

Cambridge Semantics

Hazelcast

Amazon Web Services

ByteDance, originally Terark

Initial release

2018

2008

2021

2016

Current release

2.3, January 2021

5.3.6, November 2023

2.5.0, January 2023

License

Commercial or Open Source

commercial

free trial version available

Open Source

Apache Version 2; commercial licenses available

Open Source

Apache Version 2.0

commercial

restricted open source version 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.

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

Implementation language

Java

C++

Server operating systems

Linux

All OS with a Java VM

Data scheme

Schema-free and OWL/RDFS-schema support

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

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

SQL

Support of SQL

SPARQL and SPARQL* as primary query language. Cypher preview.

SQL-like query language

APIs and other access methods

Apache Mule
gRPC
JDBC
Kafka
OData access for BI tools
OpenCypher
RESTful HTTP API
SPARQL

JCache
JPA
Memcached protocol
RESTful HTTP API

Java API
RESTful HTTP/JSON API

C++ API
Java API

Supported programming languages

C++
Java
Python

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

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C++
Java

Server-side scripts

Stored procedures

user defined functions and aggregates

yes

Event Listeners, Executor Services

yes

Triggers

yes

Events

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

Automatic sharding

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

yes

Replicated Map

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Kerberos/HDFS data loading

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency in MPP-Cluster

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

Foreign keys

Referential integrity

not needed in graphs

Transaction concepts

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

ACID

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

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

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

Access rights for users and roles

Role-based access control

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.