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
OS X
Unix
Windows

All OS with a Java VM

HP Open VMS

Linux

Data scheme

schema-free

yes

schema-free

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

Flexible Schema (defined schema, partial schema, schema free)

schema-free

Typing

predefined data types such as float or date

yes

oid, date, timestamp, binary, regex

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

via Elasticsearch

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

SQL-like query language

APIs and other access methods

HQL (Heroic Query Language, a JSON-based language)
HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

proprietary protocol using JSON

Supported programming languages

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

.Net
C++
Java
PHP
Python

Server-side scripts

Stored procedures

yes

JavaScript

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)

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Source-replica replication

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

Eventual 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

Eventual Consistency

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

Transaction concepts

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

ACID

yes, on a single node

Document is locked during a transaction

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.

User concepts

Access control

User authentification and security via Rexster Graph Server

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