DBMS > BoltDB vs. Heroic vs. JanusGraph vs. OpenSearch vs. Sphinx

System Properties Comparison BoltDB vs. Heroic vs. JanusGraph vs. OpenSearch vs. Sphinx

Editorial information provided by DB-Engines

Name

Description

An embedded key-value store for Go.

Time Series DBMS built at Spotify based on Cassandra or Google Cloud Bigtable, and ElasticSearch

A Graph DBMS optimized for distributed clusters

It was forked from the latest code base of Titan in January 2017

A distributed, RESTful search and analytics engine forked from Elasticsearch and based on Apache Lucene

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

Primary database model

Secondary database models

Vector DBMS

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

Score	0.74
Rank	#220	Overall
	#31	Key-value stores

Score	0.51
Rank	#255	Overall
	#21	Time Series DBMS

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	5.98
Rank	#56	Overall
	#5	Search engines

Website

github.com/boltdb/bolt

github.com/spotify/heroic

janusgraph.org

github.com/opensearch-project
opensearch.org

sphinxsearch.com

Technical documentation

spotify.github.io/heroic

docs.janusgraph.org

opensearch.org/docs/latest

sphinxsearch.com/docs

Developer

Spotify

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

Sphinx Technologies Inc.

Initial release

2013

2014

2017

2021

2001

Current release

0.6.3, February 2023

2.5.0, January 2023

3.5.1, February 2023

License

Commercial or Open Source

Open Source

MIT License

Open Source

Apache 2.0

Open Source

Apache 2.0

Open Source

Apache Version 2.0

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 OpenSearch: Fully managed open source search and analytics suite. Out-of-the-box integrations get you up and running in a couple of clicks.

Implementation language

Java

C++

Server operating systems

BSD
Linux
OS X
Solaris
Windows

Linux
OS X
Unix
Windows

All OS with a Java VM

FreeBSD
Linux
NetBSD
OS X
Solaris
Windows

Data scheme

schema-free

yes

schema-free

Flexible type definitions. Once a type is defined, it is persistent

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

via Elasticsearch

yes

All search fields are automatically indexed

yes

full-text index on all search fields

SQL

Support of SQL

SQL-like query language

SQL-like query language (SphinxQL)

APIs and other access methods

HQL (Heroic Query Language, a JSON-based language)
HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Proprietary protocol

Supported programming languages

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C++

unofficial client library
Java
Perl

unofficial client library
PHP
Python
Ruby

unofficial client library

Server-side scripts

Stored procedures

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

none

Sharding

yes

depending on the used storage backend (e.g. Cassandra, HBase, BerkeleyDB)

Sharding

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

Replication methods

Methods for redundantly storing data on multiple nodes

none

yes

none

MapReduce

Offers an API for user-defined Map/Reduce methods

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

none

Eventual Consistency
Immediate Consistency

Eventual Consistency

Synchronous doc based replication. Get by ID may show delays up to 1 sec. Configurable write consistency: one, quorum, all

Foreign keys

Referential integrity

yes

Relationships in graphs

Transaction concepts

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

yes

ACID

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

Supports various storage backends: Cassandra, HBase, Berkeley DB, Akiban, Hazelcast

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.

User concepts

Access control

User authentification and security via Rexster Graph Server

More information provided by the system vendor

Specific characteristics

OpenSearch is a highly scalable and extensible open-source software suite for search,...
» more

Competitive advantages

Distributed as fully open source under Apache License, Version 2.0 (ALv2), OpenSearch...
» more

Typical application scenarios

The OpenSearch platform is used across a broad range of search , analytics, and observability...
» more

Licensing and pricing models

The OpenSearch Project offers open source software licensed under Apache License...
» more

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.