DBMS > Cachelot.io vs. Cubrid vs. HugeGraph vs. MySQL vs. Sphinx

System Properties Comparison Cachelot.io vs. Cubrid vs. HugeGraph vs. MySQL vs. Sphinx

Editorial information provided by DB-Engines

Name

Description

In-memory caching system

CUBRID is an open-source SQL-based relational database management system with object extensions for OLTP

A fast-speed and highly-scalable Graph DBMS

Widely used open source RDBMS

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

Primary database model

Key/Value like access via memcached API

Search engine

Secondary database models

Document store
Spatial DBMS

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

Score	0.00
Rank	#383	Overall
	#60	Key-value stores

Score	1.20
Rank	#169	Overall
	#78	Relational DBMS

Score	0.13
Rank	#336	Overall
	#32	Graph DBMS

Score	1083.74
Rank	#2	Overall
	#2	Relational DBMS

Score	5.98
Rank	#56	Overall
	#5	Search engines

Website

cachelot.io

cubrid.com (korean)
cubrid.org (english)

github.com/hugegraph
hugegraph.apache.org

www.mysql.com

sphinxsearch.com

Technical documentation

cubrid.org/manuals

hugegraph.apache.org/docs

dev.mysql.com/doc

sphinxsearch.com/docs

Developer

CUBRID Corporation, CUBRID Foundation

Baidu

Oracle

since 2010, originally MySQL AB, then Sun

Sphinx Technologies Inc.

Initial release

2015

2008

2018

1995

2001

Current release

11.0, January 2021

0.9

8.4.0, April 2024

3.5.1, February 2023

License

Commercial or Open Source

Open Source

Simplified BSD License

Open Source

Apache Version 2.0

Open Source

Apache Version 2.0

Open Source

GPL version 2. Commercial licenses with extended functionallity are available

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.

Aiven for MySQL: Fully managed MySQL, deployable in the cloud of your choice, with seamless integrations and lightning-fast setup.

Implementation language

C++

C, C++, Java

Java

C and C++

C++

Server operating systems

FreeBSD
Linux
OS X

Linux
Windows

Linux
macOS
Unix

FreeBSD
Linux
OS X
Solaris
Windows

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema-free

yes

Typing

predefined data types such as float or date

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.

yes

Secondary indexes

yes

also supports composite index and range index

yes

full-text index on all search fields

SQL

Support of SQL

yes

with proprietary extensions

SQL-like query language (SphinxQL)

APIs and other access methods

Memcached protocol

ADO.NET
JDBC
ODBC
OLE DB

Java API
RESTful HTTP API
TinkerPop Gremlin

ADO.NET
JDBC
ODBC
Proprietary native API

Proprietary protocol

Supported programming languages

.Net
C
C++
ColdFusion
Erlang
Java
Lisp
Lua
OCaml
OCaml
Perl
PHP
Python
Ruby

C
C#
C++
Go
Java
JavaScript (Node.js)
Perl
PHP
Python
Ruby

Groovy
Java
Python

Ada
C
C#
C++
D
Delphi
Eiffel
Erlang
Haskell
Java
JavaScript (Node.js)
Objective-C
OCaml
Perl
PHP
Python
Ruby
Scheme
Tcl

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

Java Stored Procedures

asynchronous Gremlin script jobs

yes

proprietary syntax

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

none

yes

depending on used storage backend, e.g. Cassandra and HBase

horizontal partitioning, sharding with MySQL Cluster or MySQL Fabric

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

depending on used storage backend, e.g. Cassandra and HBase

Multi-source replication
Source-replica replication

none

MapReduce

Offers an API for user-defined Map/Reduce methods

via hugegraph-spark

Consistency concepts

Methods to ensure consistency in a distributed system

none

Immediate Consistency

Eventual Consistency

Immediate Consistency

Foreign keys

Referential integrity

yes

edges in graph

yes

not for MyISAM storage engine

Transaction concepts

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

ACID

not for MyISAM storage engine

Concurrency

Support for concurrent manipulation of data

yes

table locks or row locks depending on storage engine

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

fine grained access rights according to SQL-standard

Users, roles and permissions

Users with fine-grained authorization concept

no user groups or 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.