DBMS > Badger vs. JanusGraph

System Properties Comparison Badger vs. JanusGraph

Please select another system to include it in the comparison.

Our visitors often compare Badger and JanusGraph with PostgreSQL, MongoDB and Amazon DynamoDB.

Editorial information provided by DB-Engines

Name

Description

An embeddable, persistent, simple and fast Key-Value Store, written purely in Go.

A Graph DBMS optimized for distributed clusters

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

Primary database model

Key-value store

Graph DBMS

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

Score	0.20
Rank	#307	Overall
	#43	Key-value stores

Score	1.78
Rank	#134	Overall
	#12	Graph DBMS

Website

github.com/dgraph-io/badger

janusgraph.org

Technical documentation

godoc.org/github.com/dgraph-io/badger

docs.janusgraph.org

Developer

DGraph Labs

Linux Foundation; originally developed as Titan by Aurelius

Initial release

2017

Current release

1.0.0, October 2023

License

Commercial or Open Source

Open Source

Apache 2.0

Open Source

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

Implementation language

Java

Server operating systems

BSD
Linux
OS X
Solaris
Windows

Linux
OS X
Unix
Windows

Data scheme

schema-free

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

SQL

Support of SQL

APIs and other access methods

Java API
TinkerPop Blueprints
TinkerPop Frames
TinkerPop Gremlin
TinkerPop Rexster

Supported programming languages

Clojure
Java
Python

Server-side scripts

Stored procedures

yes

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

none

yes

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

Replication methods

Methods for redundantly storing data on multiple nodes

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

none

Eventual Consistency
Immediate Consistency

Foreign keys

Referential integrity

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

In-memory capabilities

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

User concepts

Access control

User authentification and security via Rexster Graph Server

More information provided by the system vendor

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.

Related products and services

We invite representatives of vendors of related products to contact us for presenting information about their offerings here.

More resources

Recent citations in the news

Suitability of Graph Database Technology for the Analysis of Spatio-Temporal Data
14 July 2020, Towards Data Science

Aerospike Is Now a Graph Database, Too
21 June 2023, Datanami

Third Time Is The Charm For Nebula Graph Database
19 January 2021, The Next Platform

Open source Microsoft Graph Engine takes on Neo4j
13 February 2017, InfoWorld

The Great Graph Debate: Revolutionary concept in databases or niche curiosity?
6 March 2023, The Register

provided by Google News

Share this page