DBMS > Datomic vs. JanusGraph vs. OpenSearch vs. TimesTen

System Properties Comparison Datomic vs. JanusGraph vs. OpenSearch vs. TimesTen

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Datomic builds on immutable values, supports point-in-time queries and uses 3rd party systems for durability

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

In-Memory RDBMS compatible to Oracle

Primary database model

Secondary database models

Vector DBMS

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

Score	1.66
Rank	#144	Overall
	#66	Relational DBMS

Score	2.02
Rank	#125	Overall
	#12	Graph DBMS

Score	16.03
Rank	#37	Overall
	#4	Search engines

Score	1.36
Rank	#161	Overall
	#75	Relational DBMS

Website

www.datomic.com

janusgraph.org

github.com/opensearch-project
opensearch.org

www.oracle.com/database/technologies/related/timesten.html

Technical documentation

docs.datomic.com

docs.janusgraph.org

opensearch.org/docs/latest

docs.oracle.com/database/timesten-18.1

Developer

Cognitect

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

Oracle, TimesTen Performance Software, HP

originally founded in HP Labs it was acquired by Oracle in 2005

Initial release

2012

2017

2021

1998

Current release

1.0.7075, December 2023

0.6.3, February 2023

2.5.0, January 2023

11 Release 2 (11.2.2.8.0)

License

Commercial or Open Source

commercial

limited edition free

Open Source

Apache 2.0

Open Source

Apache Version 2.0

commercial

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, Clojure

Java

Server operating systems

All OS with a Java VM

Linux
OS X
Unix
Windows

All OS with a Java VM

AIX
HP-UX
Linux
OS X
Solaris SPARC/x86
Windows

Data 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.

Secondary indexes

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

yes

APIs and other access methods

RESTful HTTP API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

JDBC
ODBC
ODP.NET
Oracle Call Interface (OCI)

Supported programming languages

Clojure
Java

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C
C++
Java
PL/SQL

Server-side scripts

Stored procedures

yes

Transaction Functions

yes

PL/SQL

Triggers

By using transaction functions

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

none

But extensive use of caching in the application peers

yes

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

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

none

But extensive use of caching in the application peers

yes

Multi-source replication
Source-replica replication

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

Immediate Consistency

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

Immediate Consistency or Eventual Consistency depending on configuration

Foreign keys

Referential integrity

yes

Relationships in graphs

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

using external storage systems (e.g. Cassandra, DynamoDB, PostgreSQL, Couchbase and others)

yes

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

yes

by means of logfiles and checkpoints

In-memory capabilities

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

yes

recommended only for testing and development

yes

User concepts

Access control

User authentification and security via Rexster Graph Server

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.