DBMS > Faircom DB vs. HEAVY.AI vs. RocksDB vs. Sphinx

System Properties Comparison Faircom DB vs. HEAVY.AI vs. RocksDB vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Native high-speed multi-model DBMS for relational and key-value store data simultaneously accessible through SQL and NoSQL APIs.

A high performance, column-oriented RDBMS, specifically developed to harness the massive parallelism of modern CPU and GPU hardware

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
Relational DBMS

Relational DBMS

Key-value store

Search engine

Secondary database models

Spatial DBMS

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

Score	0.24
Rank	#311	Overall
	#44	Key-value stores
	#140	Relational DBMS

Score	2.10
Rank	#126	Overall
	#61	Relational DBMS

Score	4.00
Rank	#84	Overall
	#11	Key-value stores

Score	6.03
Rank	#60	Overall
	#6	Search engines

Website

www.faircom.com/products/faircom-db

github.com/heavyai/heavydb
www.heavy.ai

rocksdb.org

sphinxsearch.com

Technical documentation

docs.faircom.com/docs/en/UUID-7446ae34-a1a7-c843-c894-d5322e395184.html

docs.heavy.ai

github.com/facebook/rocksdb/wiki

sphinxsearch.com/docs

Developer

FairCom Corporation

HEAVY.AI, Inc.

Facebook, Inc.

Sphinx Technologies Inc.

Initial release

1979

2016

2013

2001

Current release

V12, November 2020

5.10, January 2022

8.11.4, April 2024

3.5.1, February 2023

License

Commercial or Open Source

commercial

Restricted, free version available

Open Source

Apache Version 2; enterprise edition 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

ANSI C, C++

C++ and CUDA

C++

Server operating systems

AIX
FreeBSD
HP-UX
Linux
NetBSD
OS X
QNX
SCO
Solaris
VxWorks
Windows

easily portable to other OSs

Linux

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema free, schema optional, schema required, partial schema,

yes

schema-free

yes

Typing

predefined data types such as float or date

yes, ANSI SQL Types, JSON, typed binary structures

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

SQL

Support of SQL

yes, ANSI SQL with proprietary extensions

yes

SQL-like query language (SphinxQL)

APIs and other access methods

ADO.NET
Direct SQL
JDBC
JPA
ODBC
RESTful HTTP/JSON API
RESTful MQTT/JSON API
RPC

JDBC
ODBC
Thrift
Vega

C++ API
Java API

Proprietary protocol

Supported programming languages

.Net
C
C#
C++
Java
JavaScript (Node.js and browser)
PHP
Python
Visual Basic

All languages supporting JDBC/ODBC/Thrift
Python

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

.Net, JavaScript, C/C++

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

File partitioning, horizontal partitioning, sharding

Customizable business rules for table partitioning

Sharding

Round robin

horizontal partitioning

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

yes, configurable to be parallel or serial, synchronous or asynchronous, uni-directional or bi-directional, ACID-consistent or eventually consistent (with custom conflict resolution).

Multi-source replication

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Immediate Consistency
Tunable consistency per server, database, table, and transaction

Immediate Consistency

Foreign keys

Referential integrity

yes

Transaction concepts

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

tunable from ACID to Eventually Consistent

yes

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

Yes, tunable from durable to delayed durability to in-memory

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

Fine grained access rights according to SQL-standard with additional protections for files

fine grained access rights according to SQL-standard

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.