DBMS > AnzoGraph DB vs. Oracle Berkeley DB vs. RocksDB vs. Sphinx

System Properties Comparison AnzoGraph DB vs. Oracle Berkeley DB vs. RocksDB vs. Sphinx

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

Widely used in-process key-value store

Embeddable persistent key-value store optimized for fast storage (flash and RAM)

Open source search engine for searching in data from different sources, e.g. relational databases

Primary database model

Graph DBMS
RDF store

Key-value store

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

Key-value store

Search engine

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	2.21
Rank	#117	Overall
	#20	Key-value stores
	#3	Native XML DBMS

Score	3.65
Rank	#85	Overall
	#11	Key-value stores

Score	5.98
Rank	#56	Overall
	#5	Search engines

Website

cambridgesemantics.com/anzograph

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

rocksdb.org

sphinxsearch.com

Technical documentation

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

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

github.com/facebook/rocksdb/wiki

sphinxsearch.com/docs

Developer

Cambridge Semantics

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Facebook, Inc.

Sphinx Technologies Inc.

Initial release

2018

1994

2013

2001

Current release

2.3, January 2021

18.1.40, May 2020

8.11.4, April 2024

3.5.1, February 2023

License

Commercial or Open Source

commercial

free trial version available

Open Source

commercial license available

Open Source

BSD

Open Source

GPL version 2, commercial licence 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.

Implementation language

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

C++

Server operating systems

Linux

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

Linux

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

Schema-free and OWL/RDFS-schema support

schema-free

yes

Typing

predefined data types such as float or date

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

full-text index on all search fields

SQL

Support of SQL

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

yes

SQL interfaced based on SQLite is available

SQL-like query language (SphinxQL)

APIs and other access methods

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

C++ API
Java API

Proprietary protocol

Supported programming languages

C++
Java
Python

.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

C
C++
Go
Java
Perl
Python
Ruby

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

user defined functions and aggregates

Triggers

yes

only for the SQL API

Partitioning methods

Methods for storing different data on different nodes

Automatic sharding

none

horizontal partitioning

Sharding

Partitioning is done manually, search queries against distributed index is supported

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

Source-replica replication

yes

none

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

Foreign keys

Referential integrity

not needed in graphs

Transaction concepts

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

ACID

yes

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

The original contents of fields are not stored in the Sphinx index.

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

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.