DBMS > Sphinx vs. SQLite vs. Tarantool vs. Ultipa vs. VelocityDB

System Properties Comparison Sphinx vs. SQLite vs. Tarantool vs. Ultipa vs. VelocityDB

Editorial information provided by DB-Engines

Name

Description

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

Widely used embeddable, in-process RDBMS

In-memory computing platform with a flexible data schema for efficiently building high-performance applications

High performance Graph DBMS supporting HTAP high availability cluster deployment

A .NET Object Database that can be embedded/distributed and extended to a graph data model (VelocityGraph)

Primary database model

Search engine

Relational DBMS

Document store
Key-value store
Relational DBMS

Graph DBMS

Graph DBMS
Object oriented DBMS

Secondary database models

Spatial DBMS

with Tarantool/GIS extension

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

Score	5.95
Rank	#55	Overall
	#5	Search engines

Score	111.41
Rank	#10	Overall
	#7	Relational DBMS

Score	1.67
Rank	#143	Overall
	#25	Document stores
	#25	Key-value stores
	#65	Relational DBMS

Score	0.19
Rank	#330	Overall
	#30	Graph DBMS

Score	0.11
Rank	#354	Overall
	#37	Graph DBMS
	#15	Object oriented DBMS

Website

Technical documentation

sphinxsearch.com/docs

www.sqlite.org/docs.html

www.tarantool.io/en/doc

www.ultipa.com/document

velocitydb.com/UserGuide

Developer

Sphinx Technologies Inc.

Dwayne Richard Hipp

Ultipa

VelocityDB Inc

Initial release

2001

2000

2008

2019

2011

Current release

3.5.1, February 2023

3.46.0 (23 May 2024), May 2024

2.10.0, May 2022

7.x

License

Commercial or Open Source

Open Source

GPL version 2, commercial licence available

Open Source

Public Domain

Open Source

BSD-2, source-available extensions (modules), commercial licenses for Tarantool Enterprise

commercial

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

C and C++

Server operating systems

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

server-less

BSD
Linux
macOS

Any that supports .NET

Data scheme

yes

dynamic column types

Flexible data schema: relational definition for tables with ability to store json-like documents in columns

yes

Typing

predefined data types such as float or date

yes

not rigid because of 'dynamic typing' concept.

string, double, decimal, uuid, integer, blob, boolean, datetime

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.

Secondary indexes

yes

full-text index on all search fields

yes

SQL

Support of SQL

SQL-like query language (SphinxQL)

yes

SQL-92 is not fully supported

Full-featured ANSI SQL support

APIs and other access methods

Proprietary protocol

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Open binary protocol

RESTful HTTP API

.Net

Supported programming languages

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

C
C#
C++
Erlang
Go
Java
JavaScript
Lua
Perl
PHP
Python
Rust

C++
Go
Java
JavaScript (Node.js)
Python

.Net

Server-side scripts

Stored procedures

Lua, C and SQL stored procedures

Triggers

yes

yes, before/after data modification events, on replication events, client session events

Callbacks are triggered when data changes

Partitioning methods

Methods for storing different data on different nodes

Sharding

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

none

Sharding, partitioned with virtual buckets by user defined affinity key. Live resharding for scale up and scale down without maintenance downtime.

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

none

Asynchronous replication with multi-master option
Configurable replication topology (full-mesh, chain, star)
Synchronous quorum replication (with Raft)

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

Casual consistency across sharding partitions
Eventual consistency within replicaset partition

when using asyncronous replication
Immediate Consistency within single instance
Sequential consistency including linearizable read within replicaset partition

when using Raft

Immediate Consistency

Foreign keys

Referential integrity

yes

Transaction concepts

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

ACID

ACID, with serializable isolation and linearizable read (within partition); Configurable MVCC (within partition); No cross-shard distributed transactions

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

yes, cooperative multitasking

yes

Durability

Support for making data persistent

yes

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

yes

yes, write ahead logging

yes

In-memory capabilities

Is there an option to define some or all structures to be held in-memory only.

yes

yes, full featured in-memory storage engine with persistence

yes

User concepts

Access control

Access Control Lists
Mutual TLS authentication for Tarantol Enterprise
Password based authentication
Role-based access control (RBAC) and LDAP for Tarantol Enterprise
Users and Roles

Based on Windows Authentication

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.