DBMS > AnzoGraph DB vs. OpenSearch vs. Oracle Berkeley DB

System Properties Comparison AnzoGraph DB vs. OpenSearch vs. Oracle Berkeley DB

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Scalable graph database built for online analytics and data harmonization with MPP scaling, high-performance analytical algorithms and reasoning, and virtualization

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

Graph DBMS
RDF store

Search engine

Key-value store

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

Secondary database models

Vector DBMS

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

Score	0.23
Rank	#307	Overall
	#24	Graph DBMS
	#13	RDF stores

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	2.21
Rank	#117	Overall
	#20	Key-value stores
	#3	Native XML DBMS

Website

cambridgesemantics.com/anzograph

github.com/opensearch-project
opensearch.org

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

Technical documentation

docs.cambridgesemantics.com/anzograph/userdoc/home.htm

opensearch.org/docs/latest

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

Developer

Cambridge Semantics

Amazon Web Services

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Initial release

2018

2021

1994

Current release

2.3, January 2021

2.5.0, January 2023

18.1.40, May 2020

License

Commercial or Open Source

commercial

free trial version available

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.

Implementation language

Java

C, Java, C++ (depending on the Berkeley DB edition)

Server operating systems

Linux

All OS with a Java VM

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

Data scheme

Schema-free and OWL/RDFS-schema support

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

only with the Berkeley DB XML edition

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SPARQL and SPARQL* as primary query language. Cypher preview.

SQL-like query language

yes

SQL interfaced based on SQLite is available

APIs and other access methods

Apache Mule
gRPC
JDBC
Kafka
OData access for BI tools
OpenCypher
RESTful HTTP API
SPARQL

Java API
RESTful HTTP/JSON API

Supported programming languages

C++
Java
Python

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

user defined functions and aggregates

yes

Triggers

yes

by using the 'percolation' feature

yes

only for the SQL API

Partitioning methods

Methods for storing different data on different nodes

Automatic sharding

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

yes

Source-replica replication

MapReduce

Offers an API for user-defined Map/Reduce methods

Kerberos/HDFS data loading

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency in MPP-Cluster

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

not needed in graphs

Transaction concepts

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

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

Access rights for users and roles

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.