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

C++

Server operating systems

Linux
Unix
Windows

Linux
OS X
Unix
Windows

AIX
HP-UX
Linux
Solaris
Windows

All OS with a Java VM

AIX
Linux
Windows

Data scheme

yes

late-bound, schema-on-read capabilities

yes

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.

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

yes

SQL-like query language

yes

APIs and other access methods

JDBC

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

ADO.NET
JDBC
ODBC
WebDAV

Java API
RESTful HTTP/JSON API

JDBC
ODBC
Proprietary protocol

Supported programming languages

C
C#
C++
Go
Groovy
Java
PHP
Python
Scala

Clojure
Java
Python

.Net
C#
Java
Perl
PHP
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

.Net
C
C#
C++
Groovy
Java
PHP
Python

Server-side scripts

Stored procedures

user defined functions

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

Sharding

yes

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

none

Sharding

horizontal partitioning

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication
Source-replica replication

yes

Source-replica replication

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Hadoop integration

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

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

Immediate Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

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

In-memory capabilities

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

yes

managed by 'Learn by Usage'

User concepts

Access control

Access Control Lists (using HBase ACL) for RBAC, integration with Apache Ranger for RBAC & ABAC, multi-tenancy

User authentification and security via Rexster Graph Server

fine grained access rights according to SQL-standard

Access rights for users, groups and roles 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.