DBMS > Blueflood vs. Brytlyt vs. Kinetica vs. OpenSearch vs. Titan

System Properties Comparison Blueflood vs. Brytlyt vs. Kinetica vs. OpenSearch vs. Titan

Editorial information provided by DB-Engines

Name

Titan has been decommisioned after the takeover by Datastax. It will be removed from the DB-Engines ranking. A fork has been open-sourced as JanusGraph.

Description

Scalable TimeSeries DBMS based on Cassandra

Scalable GPU-accelerated RDBMS for very fast analytic and streaming workloads, leveraging PostgreSQL

Fully vectorized database across both GPUs and CPUs

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

Titan is a Graph DBMS optimized for distributed clusters.

Primary database model

Secondary database models

Spatial DBMS
Time Series DBMS

Vector DBMS

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

Score	0.13
Rank	#346	Overall
	#33	Time Series DBMS

Score	0.38
Rank	#276	Overall
	#127	Relational DBMS

Score	0.66
Rank	#234	Overall
	#107	Relational DBMS

Score	16.03
Rank	#37	Overall
	#4	Search engines

Website

blueflood.io

brytlyt.io

www.kinetica.com

github.com/opensearch-project
opensearch.org

github.com/thinkaurelius/titan

Technical documentation

github.com/rax-maas/blueflood/wiki

docs.brytlyt.io

docs.kinetica.com

opensearch.org/docs/latest

github.com/thinkaurelius/titan/wiki

Developer

Rackspace

Brytlyt

Kinetica

Amazon Web Services

Aurelius, owned by DataStax

Initial release

2013

2016

2012

2021

2012

Current release

5.0, August 2023

7.1, August 2021

2.5.0, January 2023

License

Commercial or Open Source

Open Source

Apache 2.0

commercial

Open Source

Apache Version 2.0

Open Source

Apache license, version 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 OpenSearch: Fully managed open source search and analytics suite. Out-of-the-box integrations get you up and running in a couple of clicks.
STACKIT OpenSearch offers OpenSearch in a managed version in enterprise grade, 100% GDPR-compliant, for a wide range of applications like analytics, website search, offering scalability and fast data access.

Implementation language

Java

C, C++ and CUDA

C, C++

Java

Server operating systems

Linux
OS X

Linux
OS X
Windows

Linux

All OS with a Java VM

Linux
OS X
Unix
Windows

Data scheme

predefined scheme

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.

yes

specific XML-type available, but no XML query functionality.

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

yes

SQL-like DML and DDL statements

SQL-like query language

APIs and other access methods

HTTP REST

ADO.NET
JDBC
native C library
ODBC
streaming API for large objects

JDBC
ODBC
RESTful HTTP API

Java API
RESTful HTTP/JSON API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Supported programming languages

.Net
C
C++
Delphi
Java
Perl
Python
Tcl

C++
Java
JavaScript (Node.js)
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Clojure
Java
Python

Server-side scripts

Stored procedures

user defined functions

in PL/pgSQL

user defined functions

yes

Triggers

yes

triggers when inserted values for one or more columns fall within a specified range

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

based on Cassandra

Sharding

yes

via pluggable storage backends

Replication methods

Methods for redundantly storing data on multiple nodes

selectable replication factor

based on Cassandra

Source-replica replication

yes

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

Eventual Consistency

based on Cassandra
Immediate Consistency

based on Cassandra

Immediate Consistency

Immediate Consistency or Eventual Consistency depending on configuration

Eventual Consistency

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

Eventual Consistency
Immediate Consistency

Foreign keys

Referential integrity

yes

Relationships in graph

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

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

In-memory capabilities

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

yes

GPU vRAM or System RAM

User concepts

Access control

fine grained access rights according to SQL-standard

Access rights for users and roles on table level

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.