DBMS > Axibase vs. Oracle Berkeley DB vs. Sphinx vs. SQLite

System Properties Comparison Axibase vs. Oracle Berkeley DB vs. Sphinx vs. SQLite

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Scalable TimeSeries DBMS based on HBase with integrated rule engine and visualization

Widely used in-process key-value store

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

Widely used embeddable, in-process RDBMS

Primary database model

Time Series DBMS

Key-value store

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

Search engine

Relational DBMS

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

Score	0.35
Rank	#282	Overall
	#25	Time Series DBMS

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

Score	5.95
Rank	#55	Overall
	#5	Search engines

Score	111.41
Rank	#10	Overall
	#7	Relational DBMS

Website

axibase.com/docs/atsd/finance

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

sphinxsearch.com

www.sqlite.org

Technical documentation

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

sphinxsearch.com/docs

www.sqlite.org/docs.html

Developer

Axibase Corporation

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Sphinx Technologies Inc.

Dwayne Richard Hipp

Initial release

2013

1994

2001

2000

Current release

15585

18.1.40, May 2020

3.5.1, February 2023

3.46.0 (23 May 2024), May 2024

License

Commercial or Open Source

commercial

Community Edition (single node) is free, Enterprise Edition (distributed) is paid

Open Source

commercial license available

Open Source

GPL version 2, commercial licence available

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.

Implementation language

Java

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

C++

Server operating systems

Linux

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

server-less

Data scheme

yes

schema-free

yes

dynamic column types

Typing

predefined data types such as float or date

yes

short, integer, long, float, double, decimal, string

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

only with the Berkeley DB XML edition

Secondary indexes

yes

full-text index on all search fields

yes

SQL

Support of SQL

SQL-like query language

yes

SQL interfaced based on SQLite is available

SQL-like query language (SphinxQL)

yes

SQL-92 is not fully supported

APIs and other access methods

JDBC
Proprietary protocol (Network API)
RESTful HTTP API

Proprietary protocol

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Supported programming languages

Go
Java
PHP
Python
R
Ruby

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

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

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

Triggers

yes

only for the SQL API

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

none

Sharding

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

none

Replication methods

Methods for redundantly storing data on multiple nodes

Source-replica replication

none

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

Foreign keys

Referential integrity

yes

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

Durability

Support for making data persistent

yes

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

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

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.