DBMS > JanusGraph vs. Kinetica vs. Microsoft Azure SQL Database vs. OpenSearch vs. TinkerGraph

System Properties Comparison JanusGraph vs. Kinetica vs. Microsoft Azure SQL Database vs. OpenSearch vs. TinkerGraph

Editorial information provided by DB-Engines

Name

Description

A Graph DBMS optimized for distributed clusters

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

Fully vectorized database across both GPUs and CPUs

Database as a Service offering with high compatibility to Microsoft SQL Server

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

A lightweight, in-memory graph engine that serves as a reference implementation of the TinkerPop3 API

Primary database model

Secondary database models

Spatial DBMS
Time Series DBMS

Document store
Graph DBMS
Spatial DBMS

Vector DBMS

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

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	0.64
Rank	#236	Overall
	#109	Relational DBMS

Score	77.99
Rank	#16	Overall
	#11	Relational DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	0.08
Rank	#348	Overall
	#35	Graph DBMS

Website

janusgraph.org

www.kinetica.com

azure.microsoft.com/en-us/products/azure-sql/database

github.com/opensearch-project
opensearch.org

tinkerpop.apache.org/docs/current/reference/#tinkergraph-gremlin

Technical documentation

docs.janusgraph.org

docs.kinetica.com

docs.microsoft.com/en-us/azure/azure-sql

opensearch.org/docs/latest

Developer

Linux Foundation; originally developed as Titan by Aurelius

Kinetica

Microsoft

Amazon Web Services

Initial release

2017

2012

2010

2021

2009

Current release

0.6.3, February 2023

7.1, August 2021

V12

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 2.0

Cloud-based only

Only available as a cloud service

yes

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

C++

Java

Server operating systems

Linux
OS X
Unix
Windows

Linux

hosted

All OS with a Java VM

Data scheme

yes

schema-free

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

schema-free

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

All search fields are automatically indexed

SQL

Support of SQL

SQL-like DML and DDL statements

yes

SQL-like query language

APIs and other access methods

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

JDBC
ODBC
RESTful HTTP API

ADO.NET
JDBC
ODBC

Java API
RESTful HTTP/JSON API

TinkerPop 3

Supported programming languages

Clojure
Java
Python

C++
Java
JavaScript (Node.js)
Python

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

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Groovy
Java

Server-side scripts

Stored procedures

yes

user defined functions

Transact SQL

yes

Triggers

yes

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

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

yes

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

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

yes

Source-replica replication

yes, with always 3 replicas available

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

Eventual Consistency
Immediate Consistency

Immediate Consistency or Eventual Consistency depending on configuration

Immediate Consistency

Eventual Consistency

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

none

Foreign keys

Referential integrity

yes

Relationships in graphs

yes

Relationships in graphs

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

yes

optional

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

yes

User concepts

Access control

User authentification and security via Rexster Graph Server

Access rights for users and roles on table level

fine grained access rights according to SQL-standard

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.