DBMS > Badger vs. OrigoDB vs. RocksDB vs. Sphinx

System Properties Comparison Badger vs. OrigoDB vs. RocksDB vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

An embeddable, persistent, simple and fast Key-Value Store, written purely in Go.

A fully ACID in-memory object graph database

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

Key-value store

Document store
Object oriented DBMS

Key-value store

Search engine

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

Score	0.22
Rank	#320	Overall
	#47	Key-value stores

Score	0.06
Rank	#380	Overall
	#50	Document stores
	#18	Object oriented DBMS

Score	3.41
Rank	#86	Overall
	#11	Key-value stores

Score	5.95
Rank	#55	Overall
	#5	Search engines

Website

github.com/dgraph-io/badger

origodb.com

rocksdb.org

sphinxsearch.com

Technical documentation

godoc.org/github.com/dgraph-io/badger

origodb.com/docs

github.com/facebook/rocksdb/wiki

sphinxsearch.com/docs

Developer

DGraph Labs

Robert Friberg et al

Facebook, Inc.

Sphinx Technologies Inc.

Initial release

2017

2009

under the name LiveDB

2013

2001

Current release

9.2.1, May 2024

3.5.1, February 2023

License

Commercial or Open Source

Open Source

Apache 2.0

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++

Server operating systems

BSD
Linux
OS X
Solaris
Windows

Linux
Windows

Linux

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema-free

yes

schema-free

yes

Typing

predefined data types such as float or date

User defined using .NET types and collections

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.

can be achieved using .NET

Secondary indexes

yes

full-text index on all search fields

SQL

Support of SQL

SQL-like query language (SphinxQL)

APIs and other access methods

.NET Client API
HTTP API
LINQ

C++ API
Java API

Proprietary protocol

Supported programming languages

.Net

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

yes

Triggers

yes

Domain Events

Partitioning methods

Methods for storing different data on different nodes

none

horizontal partitioning

client side managed; servers are not synchronized

horizontal partitioning

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

none

Source-replica replication

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

none

Foreign keys

Referential integrity

depending on model

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

Write ahead log

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

Role based authorization

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.