DBMS > Elasticsearch vs. Hazelcast vs. OpenSearch vs. Sphinx

System Properties Comparison Elasticsearch vs. Hazelcast vs. OpenSearch vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A distributed, RESTful modern search and analytics engine based on Apache Lucene

Elasticsearch lets you perform and combine many types of searches such as structured, unstructured, geo, and metric

A widely adopted in-memory data grid

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

Open source search engine for searching in data from different sources, e.g. relational databases

Primary database model

Search engine

Key-value store

Search engine

Secondary database models

Document store
Spatial DBMS
Vector DBMS

Document store

JSON support with IMDG 3.12

Vector DBMS

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

Score	132.83
Rank	#7	Overall
	#1	Search engines

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

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	5.95
Rank	#55	Overall
	#5	Search engines

Website

www.elastic.co/elasticsearch

hazelcast.com

github.com/opensearch-project
opensearch.org

sphinxsearch.com

Technical documentation

www.elastic.co/guide/en/elasticsearch/reference/current/index.html

hazelcast.org/imdg/docs

opensearch.org/docs/latest

sphinxsearch.com/docs

Developer

Elastic

Hazelcast

Amazon Web Services

Sphinx Technologies Inc.

Initial release

2010

2008

2021

2001

Current release

8.6, January 2023

5.3.6, November 2023

2.5.0, January 2023

3.5.1, February 2023

License

Commercial or Open Source

Open Source

Elastic License

Open Source

Apache Version 2; commercial licenses available

Open Source

Apache Version 2.0

Open Source

GPL version 2, commercial licence 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.

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

C++

Server operating systems

All OS with a Java VM

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema-free

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

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

All search fields are automatically indexed

yes

full-text index on all search fields

SQL

Support of SQL

SQL-like query language

SQL-like query language (SphinxQL)

APIs and other access methods

Java API
RESTful HTTP/JSON API

JCache
JPA
Memcached protocol
RESTful HTTP API

Java API
RESTful HTTP/JSON API

Proprietary protocol

Supported programming languages

.Net
Groovy
Community Contributed Clients
Java
JavaScript
Perl
PHP
Python
Ruby

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

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

yes

Event Listeners, Executor Services

yes

Triggers

yes

by using the 'percolation' feature

yes

Events

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

Sharding

Partitioning is done manually, search queries against distributed index is supported

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Replicated Map

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

ES-Hadoop Connector

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency

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

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

Transaction concepts

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

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

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

The original contents of fields are not stored in the Sphinx index.

In-memory capabilities

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

Memcached and Redis integration

yes

User concepts

Access control

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.