DBMS > Hazelcast vs. LeanXcale vs. OpenSearch vs. SAP SQL Anywhere vs. SQLite

System Properties Comparison Hazelcast vs. LeanXcale vs. OpenSearch vs. SAP SQL Anywhere vs. SQLite

Editorial information provided by DB-Engines

Name

Description

A widely adopted in-memory data grid

A highly scalable full ACID SQL database with fast NoSQL data ingestion and GIS capabilities

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

RDBMS database and synchronization technologies for server, desktop, remote office, and mobile environments

Widely used embeddable, in-process RDBMS

Primary database model

Key-value store

Key-value store
Relational DBMS

Search engine

Relational DBMS

Secondary database models

Document store

JSON support with IMDG 3.12

Vector DBMS

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

Score	5.97
Rank	#57	Overall
	#6	Key-value stores

Score	0.29
Rank	#291	Overall
	#41	Key-value stores
	#132	Relational DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	4.25
Rank	#79	Overall
	#43	Relational DBMS

Score	114.32
Rank	#10	Overall
	#7	Relational DBMS

Website

hazelcast.com

www.leanxcale.com

github.com/opensearch-project
opensearch.org

www.sap.com/products/technology-platform/sql-anywhere.html

www.sqlite.org

Technical documentation

hazelcast.org/imdg/docs

opensearch.org/docs/latest

help.sap.com/docs/SAP_SQL_Anywhere

www.sqlite.org/docs.html

Developer

Hazelcast

LeanXcale

Amazon Web Services

SAP

formerly Sybase

Dwayne Richard Hipp

Initial release

2008

2015

2021

1992

2000

Current release

5.3.6, November 2023

2.5.0, January 2023

17, July 2015

3.45.3 (15 April 2024), April 2024

License

Commercial or Open Source

Open Source

Apache Version 2; commercial licenses available

commercial

Open Source

Apache Version 2.0

commercial

Open Source

Public Domain

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.

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

Server operating systems

All OS with a Java VM

AIX
HP-UX
Linux
OS X
Solaris
Windows

server-less

Data scheme

schema-free

yes

schema-free

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

yes

dynamic column types

Typing

predefined data types such as float or date

yes

not rigid because of 'dynamic typing' concept.

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

the object must implement a serialization strategy

yes

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

through Apache Derby

SQL-like query language

yes

SQL-92 is not fully supported

APIs and other access methods

JCache
JPA
Memcached protocol
RESTful HTTP API

JDBC
Kafka Connector
ODBC
proprietary key/value interface
Spark Connector

Java API
RESTful HTTP/JSON API

ADO.NET
HTTP API
JDBC
ODBC

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Supported programming languages

.Net
C#
C++
Clojure
Go
Java
JavaScript (Node.js)
Python
Scala

C
Java
Scala

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

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

Actionscript
Ada
Basic
C
C#
C++
D
Delphi
Forth
Fortran
Haskell
Java
JavaScript
Lisp
Lua
MatLab
Objective-C
OCaml
Perl
PHP
PL/SQL
Python
R
Ruby
Scala
Scheme
Smalltalk
Tcl

Server-side scripts

Stored procedures

yes

Event Listeners, Executor Services

yes

yes, in C/C++, Java, .Net or Perl

Triggers

yes

Events

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Replicated Map

yes

Source-replica replication

Database mirroring

none

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency or Eventual Consistency selectable by user

Raft Consensus Algorithm

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

one or two-phase-commit; repeatable reads; read commited

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

Durability

Support for making data persistent

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

Role-based access control

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.