DBMS > Faircom DB vs. JanusGraph vs. OpenSearch

System Properties Comparison Faircom DB vs. JanusGraph vs. OpenSearch

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Native high-speed multi-model DBMS for relational and key-value store data simultaneously accessible through SQL and NoSQL APIs.

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

Primary database model

Key-value store
Relational DBMS

Graph DBMS

Search engine

Secondary database models

Vector DBMS

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

Score	0.20
Rank	#318	Overall
	#48	Key-value stores
	#141	Relational DBMS

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Website

www.faircom.com/products/faircom-db

janusgraph.org

github.com/opensearch-project
opensearch.org

Technical documentation

docs.faircom.com/docs/en/UUID-7446ae34-a1a7-c843-c894-d5322e395184.html

docs.janusgraph.org

opensearch.org/docs/latest

Developer

FairCom Corporation

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

Initial release

1979

2017

2021

Current release

V12, November 2020

0.6.3, February 2023

2.5.0, January 2023

License

Commercial or Open Source

commercial

Restricted, free version available

Open Source

Apache 2.0

Open Source

Apache 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

ANSI C, C++

Java

Server operating systems

AIX
FreeBSD
HP-UX
Linux
NetBSD
OS X
QNX
SCO
Solaris
VxWorks
Windows

easily portable to other OSs

Linux
OS X
Unix
Windows

All OS with a Java VM

Data scheme

schema free, schema optional, schema required, partial schema,

yes

schema-free

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

Typing

predefined data types such as float or date

yes, ANSI SQL Types, JSON, typed binary structures

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

SQL

Support of SQL

yes, ANSI SQL with proprietary extensions

SQL-like query language

APIs and other access methods

ADO.NET
Direct SQL
JDBC
JPA
ODBC
RESTful HTTP/JSON API
RESTful MQTT/JSON API
RPC

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Supported programming languages

.Net
C
C#
C++
Java
JavaScript (Node.js and browser)
PHP
Python
Visual Basic

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Server-side scripts

Stored procedures

yes

.Net, JavaScript, C/C++

yes

Triggers

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

File partitioning, horizontal partitioning, sharding

Customizable business rules for table partitioning

yes

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

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

yes, configurable to be parallel or serial, synchronous or asynchronous, uni-directional or bi-directional, ACID-consistent or eventually consistent (with custom conflict resolution).

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
Immediate Consistency
Tunable consistency per server, database, table, and transaction

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

tunable from ACID to Eventually Consistent

ACID

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

Yes, tunable from durable to delayed durability to in-memory

yes

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

yes

In-memory capabilities

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

yes

User concepts

Access control

Fine grained access rights according to SQL-standard with additional protections for files

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.