DBMS > Hazelcast vs. OpenEdge vs. OpenSearch vs. Oracle Berkeley DB

System Properties Comparison Hazelcast vs. OpenEdge vs. OpenSearch vs. Oracle Berkeley DB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

A widely adopted in-memory data grid

Application development environment with integrated database management system

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

Widely used in-process key-value store

Primary database model

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

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.46
Rank	#61	Overall
	#7	Key-value stores

Score	3.45
Rank	#85	Overall
	#46	Relational DBMS

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	2.01
Rank	#126	Overall
	#21	Key-value stores
	#3	Native XML DBMS

Website

hazelcast.com

www.progress.com/openedge

github.com/opensearch-project
opensearch.org

www.oracle.com/database/technologies/related/berkeleydb.html

Technical documentation

hazelcast.org/imdg/docs

documentation.progress.com/output/ua/OpenEdge_latest

opensearch.org/docs/latest

docs.oracle.com/cd/E17076_05/html/index.html

Developer

Hazelcast

Progress Software Corporation

Amazon Web Services

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Initial release

2008

1984

2021

1994

Current release

5.3.6, November 2023

OpenEdge 12.2, March 2020

2.5.0, January 2023

18.1.40, May 2020

License

Commercial or Open Source

Open Source

Apache Version 2; commercial licenses available

commercial

Open Source

Apache Version 2.0

Open Source

commercial license available

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.
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, Java, C++ (depending on the Berkeley DB edition)

Server operating systems

All OS with a Java VM

AIX
HP-UX
Linux
Solaris
Windows

All OS with a Java VM

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

Data scheme

schema-free

yes

schema-free

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

schema-free

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

the object must implement a serialization strategy

yes

only with the Berkeley DB XML edition

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

close to SQL 92

SQL-like query language

yes

SQL interfaced based on SQLite is available

APIs and other access methods

JCache
JPA
Memcached protocol
RESTful HTTP API

JDBC
ODBC

Java API
RESTful HTTP/JSON API

Supported programming languages

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

Progress proprietary ABL (Advanced Business Language)

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

.Net

Figaro is a .Net framework assembly that extends Berkeley DB XML into an embeddable database engine for .NET
others

Third-party libraries to manipulate Berkeley DB files are available for many languages
C
C#
C++
Java
JavaScript (Node.js)

3rd party binding
Perl
Python
Tcl

Server-side scripts

Stored procedures

yes

Event Listeners, Executor Services

yes

Triggers

yes

Events

yes

by using the 'percolation' feature

yes

only for the SQL API

Partitioning methods

Methods for storing different data on different nodes

Sharding

horizontal partitioning

since Version 11.4

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Replicated Map

Source-replica replication

yes

Source-replica replication

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

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

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

Users and groups

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.