DBMS > KeyDB vs. LeanXcale vs. Machbase Neo vs. Sphinx

System Properties Comparison KeyDB vs. LeanXcale vs. Machbase Neo vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

An ultra-fast, open source Key-value store fully compatible with Redis API, modules, and protocols

A highly scalable full ACID SQL database with fast NoSQL data ingestion and GIS capabilities

TimeSeries DBMS for AIoT and BigData

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

Primary database model

Key-value store

Key-value store
Relational DBMS

Time Series DBMS

Search engine

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

Score	0.63
Rank	#232	Overall
	#32	Key-value stores

Score	0.28
Rank	#286	Overall
	#41	Key-value stores
	#130	Relational DBMS

Score	0.07
Rank	#348	Overall
	#34	Time Series DBMS

Score	5.97
Rank	#56	Overall
	#5	Search engines

Website

github.com/Snapchat/KeyDB
keydb.dev

www.leanxcale.com

machbase.com

sphinxsearch.com

Technical documentation

docs.keydb.dev

machbase.com/dbms

sphinxsearch.com/docs

Developer

EQ Alpha Technology Ltd.

LeanXcale

Machbase

Sphinx Technologies Inc.

Initial release

2019

2015

2013

2001

Current release

V8.0, August 2023

3.5.1, February 2023

License

Commercial or Open Source

Open Source

BSD-3

commercial

free test version 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.

Implementation language

C++

Server operating systems

Linux

Linux
macOS
Windows

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema-free

yes

Typing

predefined data types such as float or date

partial

Supported data types are strings, hashes, lists, sets and sorted sets, bit arrays, hyperloglogs and geospatial indexes

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

by using the Redis Search module

yes

full-text index on all search fields

SQL

Support of SQL

yes

through Apache Derby

SQL-like query language

SQL-like query language (SphinxQL)

APIs and other access methods

Proprietary protocol

RESP - REdis Serialization Protoco

JDBC
Kafka Connector
ODBC
proprietary key/value interface
Spark Connector

gRPC
HTTP REST
JDBC
MQTT (Message Queue Telemetry Transport)
ODBC

Proprietary protocol

Supported programming languages

C
C#
C++
Clojure
Crystal
D
Dart
Elixir
Erlang
Fancy
Go
Haskell
Haxe
Java
JavaScript (Node.js)
Lisp
Lua
MatLab
Objective-C
OCaml
Pascal
Perl
PHP
Prolog
Pure Data
Python
R
Rebol
Ruby
Rust
Scala
Scheme
Smalltalk
Swift
Tcl
Visual Basic

C
Java
Scala

C
C#
C++
Go
Java
JavaScript
PHP

via ODBC
Python
R

via ODBC
Scala

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

Lua

Triggers

Partitioning methods

Methods for storing different data on different nodes

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication
Source-replica replication

selectable replication factor

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency
Strong eventual consistency with CRDTs

Immediate Consistency

Foreign keys

Referential integrity

yes

Transaction concepts

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

Optimistic locking, atomic execution of commands blocks and scripts

ACID

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

Configurable mechanisms for persistency via snapshots and/or operations logs

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

volatile and lookup table

User concepts

Access control

simple password-based access control and ACL

simple password-based 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.

Related products and services

We invite representatives of vendors of related products to contact us for presenting information about their offerings here.

More resources

DB-Engines blog posts

The DB-Engines ranking includes now search engines
4 February 2013, Paul Andlinger

show all

Recent citations in the news

Snap snaps up database developer KeyDB to make its infrastructure more snappy
12 May 2022, TechCrunch

Introducing Garnet – an open-source, next-generation, faster cache-store for accelerating applications and services
18 March 2024, Microsoft

Microsoft open-sources unique “Garnet” cache-store; a Redis rival?
19 March 2024, The Stack

Dragonfly 0.13 Database Adds Experimental SSD-Based Data Tiering, More SIMD Work
2 January 2023, Phoronix

With Indigenous AWS Silicon Plumbed In, Cloud Giant Flexes its Arm (Chips)
12 May 2020, Tech Monitor

provided by Google News

Switching From Sphinx to MkDocs Documentation — What Did I Gain and Lose?
2 February 2024, Towards Data Science

Manticore is a Faster Alternative to Elasticsearch in C++
25 July 2022, hackernoon.com

Beyond the Concert Hall: 5 Organizations Making a Difference in Classical Music in 2018
22 December 2018, WQXR Radio

Here’s Why Russia Is Cracking Down on Google
23 February 2015, TIME

The Pirate Bay was recently down for over a week due to a DDoS attack
29 October 2019, The Hacker News

provided by Google News

Share this page