DBMS > FatDB vs. InfinityDB vs. JanusGraph vs. OpenSearch

System Properties Comparison FatDB vs. InfinityDB vs. JanusGraph vs. OpenSearch

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

FatDB/FatCloud has ceased operations as a company with February 2014. FatDB is discontinued and excluded from the ranking.

Description

A .NET NoSQL DBMS that can integrate with and extend SQL Server.

A Java embedded Key-Value Store which extends the Java Map interface

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

Document store
Key-value store

Key-value store

Graph DBMS

Search engine

Secondary database models

Vector DBMS

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

Score	0.00
Rank	#378	Overall
	#57	Key-value stores

Score	1.94
Rank	#129	Overall
	#12	Graph DBMS

Score	16.36
Rank	#37	Overall
	#4	Search engines

Website

boilerbay.com

janusgraph.org

github.com/opensearch-project
opensearch.org

Technical documentation

boilerbay.com/infinitydb/manual

docs.janusgraph.org

opensearch.org/docs/latest

Developer

FatCloud

Boiler Bay Inc.

Linux Foundation; originally developed as Titan by Aurelius

Amazon Web Services

Initial release

2012

2002

2017

2021

Current release

4.0

0.6.3, February 2023

2.5.0, January 2023

License

Commercial or Open Source

commercial

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.

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

Server operating systems

Windows

All OS with a Java VM

Linux
OS X
Unix
Windows

All OS with a Java VM

Data scheme

schema-free

yes

nested virtual Java Maps, multi-value, logical â€˜tuple spaceâ€™ runtime Schema upgrade

yes

schema-free

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

Typing

predefined data types such as float or date

yes

all Java primitives, Date, CLOB, BLOB, huge sparse arrays

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

manual creation possible, using inversions based on multi-value capability

yes

All search fields are automatically indexed

SQL

Support of SQL

Via inetgration in SQL Server

SQL-like query language

APIs and other access methods

.NET Client API
LINQ
RESTful HTTP API
RPC
Windows WCF Bindings

Access via java.util.concurrent.ConcurrentNavigableMap Interface
Proprietary API to InfinityDB ItemSpace (boilerbay.com/docs/ItemSpaceDataStructures.htm)

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Java API
RESTful HTTP/JSON API

Supported programming languages

Java

Clojure
Java
Python

Go
Java
JavaScript (Node.js)
PHP
Python
Ruby

Elasticsearch client

Server-side scripts

Stored procedures

yes

via applications

yes

Triggers

yes

via applications

yes

by using the 'percolation' feature

Partitioning methods

Methods for storing different data on different nodes

Sharding

none

yes

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

Sharding

Replication methods

Methods for redundantly storing data on multiple nodes

selectable replication factor

none

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

Immediate Consistency

READ-COMMITTED or SERIALIZED

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

manual creation possible, using inversions based on multi-value capability

yes

Relationships in graphs

Transaction concepts

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

ACID

Optimistic locking for transactions; no isolation for bulk loads

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

In-memory capabilities

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

User concepts

Access control

Can implement custom security layer via applications

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.