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

Java

Server operating systems

Linux
OS X
Windows

AIX
HP Open VMS
HP-UX
Linux
OS X
Solaris
Windows

Linux
OS X
Unix
Windows

Illumos
Linux
OS X
Windows

All OS with a Java VM

Data scheme

schema-free

depending on used data model

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.

yes

Secondary indexes

yes

All search fields are automatically indexed

SQL

Support of SQL

yes

SQL-like query language

APIs and other access methods

GraphQL query language
gRPC (using protocol buffers) API
HTTP API

.NET Client API
JDBC
ODBC
RESTful HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Supported programming languages

C#
C++
Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

C#
C++
Java

Clojure
Java
Python

C++
Go
Java

3rd party binding
JavaScript (Node.js)

3rd party binding
Python

3rd party binding

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Server-side scripts

Stored procedures

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

yes

none

yes

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

none

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

Synchronous replication via Raft

Source-replica replication

yes

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

Eventual Consistency
Immediate 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

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

Durability

Support for making data persistent

yes

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

yes

with automatic compression on writes

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

Planned for future releases

Access rights for users, groups and roles

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.