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

JavaScript

Java

C and C++

Server operating systems

server-less, requires a JavaScript environment (browser, Node.js)

Linux
OS X
Unix

All OS with a Java VM

AIX
HP-UX
Linux
OS X
Solaris
Windows
z/OS

Data scheme

schema-free

yes

schema-less columns are supported

schema-free

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

yes

Schemaless in JSON and XML columns

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

yes

SQL

Support of SQL

Close to SQL99, but no user access control, stored procedures and host language bindings.

SQL for querying

SQL-like query language

yes

with proprietary extensions

APIs and other access methods

JavaScript API

JDBC
RESTful HTTP/JSON API

Java API
RESTful HTTP/JSON API

JDBC
ODBC
ODP.NET
Oracle Call Interface (OCI)

Supported programming languages

JavaScript

Clojure
JavaScript
PHP
Python
R
Ruby
Scala

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C
C#
C++
Clojure
Cobol
Delphi
Eiffel
Erlang
Fortran
Groovy
Haskell
Java
JavaScript
Lisp
Objective C
OCaml
Perl
PHP
Python
R
Ruby
Scala
Tcl
Visual Basic

Server-side scripts

Stored procedures

yes

PL/SQL

also stored procedures in Java possible

Triggers

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

none

Sharding

manual/auto, time-based

Sharding

Sharding, horizontal partitioning

Replication methods

Methods for redundantly storing data on multiple nodes

none

yes, via HDFS, S3 or other storage engines

yes

Multi-source replication
Source-replica replication

MapReduce

Offers an API for user-defined Map/Reduce methods

can be realized in PL/SQL

Consistency concepts

Methods to ensure consistency in a distributed system

none

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

Transaction concepts

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

yes

only for local storage and DOM-storage

ACID

isolation level can be parameterized

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

by using IndexedDB, SQL.JS or proprietary FileStorage

yes

In-memory capabilities

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

yes

Version 12c introduced the new option 'Oracle Database In-Memory'

User concepts

Access control

RBAC using LDAP or Druid internals for users and groups for read/write by datasource and system

fine grained access rights 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.