DBMS > AnzoGraph DB vs. Faircom DB vs. JanusGraph vs. SQLite

System Properties Comparison AnzoGraph DB vs. Faircom DB vs. JanusGraph vs. SQLite

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Scalable graph database built for online analytics and data harmonization with MPP scaling, high-performance analytical algorithms and reasoning, and virtualization

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

Widely used embeddable, in-process RDBMS

Primary database model

Graph DBMS
RDF store

Key-value store
Relational DBMS

Graph DBMS

Relational DBMS

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

Score	0.29
Rank	#303	Overall
	#25	Graph DBMS
	#14	RDF stores

Score	0.29
Rank	#304	Overall
	#43	Key-value stores
	#136	Relational DBMS

Score	2.02
Rank	#125	Overall
	#12	Graph DBMS

Score	111.41
Rank	#10	Overall
	#7	Relational DBMS

Website

cambridgesemantics.com/anzograph

www.faircom.com/products/faircom-db

janusgraph.org

www.sqlite.org

Technical documentation

docs.cambridgesemantics.com/anzograph/userdoc/home.htm

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

docs.janusgraph.org

www.sqlite.org/docs.html

Developer

Cambridge Semantics

FairCom Corporation

Linux Foundation; originally developed as Titan by Aurelius

Dwayne Richard Hipp

Initial release

2018

1979

2017

2000

Current release

2.3, January 2021

V12, November 2020

0.6.3, February 2023

3.46.0 (23 May 2024), May 2024

License

Commercial or Open Source

commercial

free trial version available

commercial

Restricted, free version available

Open Source

Apache 2.0

Open Source

Public Domain

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

ANSI C, C++

Java

Server operating systems

Linux

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

easily portable to other OSs

Linux
OS X
Unix
Windows

server-less

Data scheme

Schema-free and OWL/RDFS-schema support

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

yes

dynamic column types

Typing

predefined data types such as float or date

yes, ANSI SQL Types, JSON, typed binary structures

yes

not rigid because of 'dynamic typing' concept.

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

SPARQL and SPARQL* as primary query language. Cypher preview.

yes, ANSI SQL with proprietary extensions

yes

SQL-92 is not fully supported

APIs and other access methods

Apache Mule
gRPC
JDBC
Kafka
OData access for BI tools
OpenCypher
RESTful HTTP API
SPARQL

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

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Supported programming languages

C++
Java
Python

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

Clojure
Java
Python

Actionscript
Ada
Basic
C
C#
C++
D
Delphi
Forth
Fortran
Haskell
Java
JavaScript
Lisp
Lua
MatLab
Objective-C
OCaml
Perl
PHP
PL/SQL
Python
R
Ruby
Scala
Scheme
Smalltalk
Tcl

Server-side scripts

Stored procedures

user defined functions and aggregates

yes

.Net, JavaScript, C/C++

yes

Triggers

yes

Partitioning methods

Methods for storing different data on different nodes

Automatic sharding

File partitioning, horizontal partitioning, sharding

Customizable business rules for table partitioning

yes

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

none

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

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

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Kerberos/HDFS data loading

yes

via Faunus, a graph analytics engine

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency in MPP-Cluster

Eventual Consistency
Immediate Consistency
Tunable consistency per server, database, table, and transaction

Eventual Consistency
Immediate Consistency

Foreign keys

Referential integrity

not needed in graphs

yes

Relationships in graphs

yes

Transaction concepts

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

ACID

tunable from ACID to Eventually Consistent

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

Durability

Support for making data persistent

yes

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

Access rights for users and roles

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

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.