DBMS > Kinetica vs. OpenSearch vs. Oracle vs. VoltDB

System Properties Comparison Kinetica vs. OpenSearch vs. Oracle vs. VoltDB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Fully vectorized database across both GPUs and CPUs

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

Widely used RDBMS

Distributed In-Memory NewSQL RDBMS

Used for OLTP applications with a high frequency of relatively simple transactions, that can hold all their data in memory

Primary database model

Relational DBMS

Search engine

Relational DBMS

Secondary database models

Spatial DBMS
Time Series DBMS

Vector DBMS

Document store
Graph DBMS

with Oracle Spatial and Graph
RDF store

with Oracle Spatial and Graph
Spatial DBMS

with Oracle Spatial and Graph
Vector DBMS

since Oracle 23

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

Score	0.69
Rank	#234	Overall
	#107	Relational DBMS

Score	15.65
Rank	#38	Overall
	#4	Search engines

Score	1234.27
Rank	#1	Overall
	#1	Relational DBMS

Score	1.46
Rank	#159	Overall
	#74	Relational DBMS

Website

www.kinetica.com

github.com/opensearch-project
opensearch.org

www.oracle.com/database

www.voltdb.com

Technical documentation

docs.kinetica.com

opensearch.org/docs/latest

docs.oracle.com/en/database

docs.voltdb.com

Developer

Kinetica

Amazon Web Services

Oracle

VoltDB Inc.

Initial release

2012

2021

1980

2010

Current release

7.1, August 2021

2.5.0, January 2023

23c, September 2023

11.3, April 2022

License

Commercial or Open Source

commercial

Open Source

Apache Version 2.0

commercial

restricted free version is available

Open Source

AGPL for Community Edition, commercial license for Enterprise, AWS, and Pro Editions

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.

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

C, C++

Java

C and C++

Java, C++

Server operating systems

Linux

All OS with a Java VM

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

Linux
OS X

for development

Data scheme

yes

schema-free

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

yes

Schemaless in JSON and XML columns

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

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like DML and DDL statements

SQL-like query language

yes

with proprietary extensions

yes

only a subset of SQL 99

APIs and other access methods

JDBC
ODBC
RESTful HTTP API

Java API
RESTful HTTP/JSON API

JDBC
ODBC
ODP.NET
Oracle Call Interface (OCI)

Java API
JDBC
RESTful HTTP/JSON API

Supported programming languages

C++
Java
JavaScript (Node.js)
Python

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

C#
C++
Erlang

not officially supported
Go
Java
JavaScript

Node.js
PHP
Python

Server-side scripts

Stored procedures

user defined functions

yes

PL/SQL

also stored procedures in Java possible

Java

Triggers

yes

triggers when inserted values for one or more columns fall within a specified range

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

Sharding, horizontal partitioning

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

Source-replica replication

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

Immediate Consistency or Eventual Consistency depending on configuration

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

FOREIGN KEY constraints are not supported

Transaction concepts

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

ACID

isolation level can be parameterized

ACID

Transactions are executed single-threaded within stored procedures

Concurrency

Support for concurrent manipulation of data

yes

Data access is serialized by the server

Durability

Support for making data persistent

yes

Snapshots and command logging

In-memory capabilities

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

yes

GPU vRAM or System RAM

yes

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

User concepts

Access control

Access rights for users and roles on table level

fine grained access rights according to SQL-standard

Users and roles with access to stored procedures

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.