DBMS > CockroachDB vs. MarkLogic vs. MySQL vs. Sphinx vs. Trafodion

System Properties Comparison CockroachDB vs. MarkLogic vs. MySQL vs. Sphinx vs. Trafodion

Editorial information provided by DB-Engines

Name

Apache Trafodion has been retired in 2021. Therefore it is excluded from the DB-Engines Ranking.

Description

CockroachDB is a distributed database architected for modern cloud applications. It is wire compatible with PostgreSQL and backed by a Key-Value Store, which is either RocksDB or a purpose-built derivative, called Pebble.

Operational and transactional Enterprise NoSQL database

Widely used open source RDBMS

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

Transactional SQL-on-Hadoop DBMS

Primary database model

Relational DBMS

Document store
Native XML DBMS
RDF store

as of version 7
Search engine

Relational DBMS

Key/Value like access via memcached API

Search engine

Relational DBMS

Secondary database models

Document store
Spatial DBMS

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

Score	6.15
Rank	#55	Overall
	#33	Relational DBMS

Score	5.92
Rank	#58	Overall
	#10	Document stores
	#1	Native XML DBMS
	#1	RDF stores
	#6	Search engines

Score	1083.74
Rank	#2	Overall
	#2	Relational DBMS

Score	5.98
Rank	#56	Overall
	#5	Search engines

Website

www.cockroachlabs.com

Technical documentation

www.cockroachlabs.com/docs

docs.marklogic.com

dev.mysql.com/doc

sphinxsearch.com/docs

trafodion.apache.org/documentation.html

Developer

Cockroach Labs

MarkLogic Corp.

Oracle

since 2010, originally MySQL AB, then Sun

Sphinx Technologies Inc.

Apache Software Foundation, originally developed by HP

Initial release

2015

2001

1995

2001

2014

Current release

24.1.0, May 2024

11.0, December 2022

8.4.0, April 2024

3.5.1, February 2023

2.3.0, February 2019

License

Commercial or Open Source

Open Source

Apache 2.0, commercial license available

commercial

restricted free version is available

Open Source

GPL version 2. Commercial licenses with extended functionallity are available

Open Source

GPL version 2, commercial licence available

Open Source

Apache 2.0

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

C++

C++, Java

Server operating systems

Linux
macOS
Windows

Linux
OS X
Windows

FreeBSD
Linux
OS X
Solaris
Windows

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Linux

Data scheme

dynamic schema

schema-free

Schema can be enforced

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

full-text index on all search fields

yes

SQL

Support of SQL

yes, wire compatible with PostgreSQL

yes

SQL92

yes

with proprietary extensions

SQL-like query language (SphinxQL)

yes

APIs and other access methods

JDBC

Java API
Node.js Client API
ODBC
proprietary Optic API

Proprietary Query API, introduced with version 9
RESTful HTTP API
SPARQL
WebDAV
XDBC
XQuery
XSLT

ADO.NET
JDBC
ODBC
Proprietary native API

Proprietary protocol

ADO.NET
JDBC
ODBC

Supported programming languages

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

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

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

All languages supporting JDBC/ODBC/ADO.Net

Server-side scripts

Stored procedures

yes

via XQuery or JavaScript

yes

proprietary syntax

Java Stored Procedures

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

horizontal partitioning (by key range)

all tables are translated to an ordered KV store and then broken down into 64MB ranges, which are then used as replicas in RAFT

Sharding

horizontal partitioning, sharding with MySQL Cluster or MySQL Fabric

Sharding

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

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication using RAFT

yes

Multi-source replication
Source-replica replication

none

yes, via HBase

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Hadoop Connector, HDFS Direct Access and in-database MapReduce jobs

yes

via user defined functions and HBase

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency

Foreign keys

Referential integrity

yes

not for MyISAM storage engine

yes

Transaction concepts

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

ACID

can act as a resource manager in an XA/JTA transaction

ACID

not for MyISAM storage engine

ACID

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.

yes

In-memory capabilities

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

yes, with Range Indexes

yes

User concepts

Access control

Role-based access control

Role-based access control at the document and subdocument levels

Users with fine-grained authorization concept

no user groups or roles

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.