DBMS > Dgraph vs. Realm vs. SAP HANA vs. Sphinx

System Properties Comparison Dgraph vs. Realm vs. SAP HANA vs. Sphinx

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Distributed and scalable native Graph DBMS

A DBMS built for use on mobile devices that’s a fast, easy to use alternative to SQLite and Core Data

In-memory, column based data store. Available as appliance or cloud service

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

Primary database model

Secondary database models

Document store
Graph DBMS

with SAP Hana, Enterprise Edition
Spatial DBMS

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

Score	1.45
Rank	#156	Overall
	#15	Graph DBMS

Score	7.60
Rank	#52	Overall
	#9	Document stores

Score	44.69
Rank	#22	Overall
	#16	Relational DBMS

Score	5.98
Rank	#56	Overall
	#5	Search engines

Website

dgraph.io

realm.io

www.sap.com/products/hana.html

sphinxsearch.com

Technical documentation

dgraph.io/docs

realm.io/docs

help.sap.com/hana

sphinxsearch.com/docs

Developer

Dgraph Labs, Inc.

Realm, acquired by MongoDB in May 2019

SAP

Sphinx Technologies Inc.

Initial release

2016

2014

2010

2001

Current release

2.0 SPS07 (April 4, 2023), April 2023

3.5.1, February 2023

License

Commercial or Open Source

Open Source

Apache 2.0

Open Source

commercial

Open Source

GPL version 2, commercial licence available

Cloud-based only

Only available as a cloud service

also available as a cloud based 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
OS X
Windows

Android
Backend: server-less
iOS
Windows

Appliance or cloud-service

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.

Secondary indexes

yes

full-text index on all search fields

SQL

Support of SQL

yes

SQL-like query language (SphinxQL)

APIs and other access methods

GraphQL query language
gRPC (using protocol buffers) API
HTTP API

JDBC
ODBC

Proprietary protocol

Supported programming languages

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

.Net
Java

with Android only
Objective-C
React Native
Swift

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

runs within the applications so server-side scripts are unnecessary

SQLScript, R

Triggers

yes

Change Listeners

yes

Partitioning methods

Methods for storing different data on different nodes

yes

none

yes

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

Synchronous replication via Raft

none

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency

Foreign keys

Referential integrity

yes

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

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

In-Memory realm

yes

User concepts

Access control

Planned for future releases

yes

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.