DBMS > CouchDB vs. OpenSearch vs. TigerGraph vs. Titan

System Properties Comparison CouchDB vs. OpenSearch vs. TigerGraph vs. Titan

Please select another system to include it in the comparison.

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

A native JSON - document store inspired by Lotus Notes, scalable from globally distributed server-clusters down to mobile phones.

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

A complete, distributed, parallel graph computing platform supporting web-scale data analytics in real-time

Titan is a Graph DBMS optimized for distributed clusters.

Primary database model

Document store

Search engine

Graph DBMS

Secondary database models

Spatial DBMS

using the Geocouch extension

Vector DBMS

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

Score	9.30
Rank	#45	Overall
	#7	Document stores

Score	16.36
Rank	#37	Overall
	#4	Search engines

Score	1.83
Rank	#139	Overall
	#13	Graph DBMS

Website

couchdb.apache.org

github.com/opensearch-project
opensearch.org

www.tigergraph.com

github.com/thinkaurelius/titan

Technical documentation

docs.couchdb.org/en/stable

opensearch.org/docs/latest

docs.tigergraph.com

github.com/thinkaurelius/titan/wiki

Developer

Apache Software Foundation

Apache top-level project, originally developed by Damien Katz, a former Lotus Notes developer

Amazon Web Services

Aurelius, owned by DataStax

Initial release

2005

2021

2017

2012

Current release

3.3.3, December 2023

2.5.0, January 2023

License

Commercial or Open Source

Open Source

Apache version 2

Open Source

Apache Version 2.0

commercial

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

Erlang

Java

C++

Java

Server operating systems

Android
BSD
Linux
OS X
Solaris
Windows

All OS with a Java VM

Linux

Linux
OS X
Unix
Windows

Data scheme

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 views

yes

All search fields are automatically indexed

yes

SQL

Support of SQL

SQL-like query language

SQL-like query language (GSQL)

APIs and other access methods

RESTful HTTP/JSON API

Java API
RESTful HTTP/JSON API

GSQL (TigerGraph Query Language)
Kafka
RESTful HTTP/JSON API

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Supported programming languages

C
C#
ColdFusion
Erlang
Haskell
Java
JavaScript
Lisp
Lua
Objective-C
OCaml
Perl
PHP
PL/SQL
Python
Ruby
Smalltalk

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

C++
Java

Clojure
Java
Python

Server-side scripts

Stored procedures

View functions in JavaScript

yes

Triggers

yes

by using the 'percolation' feature

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

improved architecture with release 2.0

Sharding

yes

via pluggable storage backends

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication
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

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 graphs

yes

Relationships in graph

Transaction concepts

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

atomic operations within a single document possible

ACID

Concurrency

Support for concurrent manipulation of data

yes

strategy: optimistic locking

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.

User concepts

Access control

Access rights for users can be defined per database

Role-based 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.