DBMS > AnzoGraph DB vs. ArcadeDB vs. Faircom DB

System Properties Comparison AnzoGraph DB vs. ArcadeDB vs. Faircom DB

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

Fast and scalable multi-model DBMS, originally forked from OrientDB but most of the code has been rewritten

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

Primary database model

Graph DBMS
RDF store

Document store
Graph DBMS
Key-value store
Time Series DBMS

in next version

Key-value store
Relational DBMS

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

Score	0.27
Rank	#302	Overall
	#24	Graph DBMS
	#13	RDF stores

Score	0.09
Rank	#355	Overall
	#48	Document stores
	#37	Graph DBMS
	#52	Key-value stores
	#34	Time Series DBMS

Score	0.24
Rank	#311	Overall
	#44	Key-value stores
	#140	Relational DBMS

Website

cambridgesemantics.com/anzograph

arcadedb.com

www.faircom.com/products/faircom-db

Technical documentation

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

docs.arcadedb.com

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

Developer

Cambridge Semantics

Arcade Data

FairCom Corporation

Initial release

2018

2021

1979

Current release

2.3, January 2021

September 2021

V12, November 2020

License

Commercial or Open Source

commercial

free trial version available

Open Source

Apache Version 2.0

commercial

Restricted, free version available

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

ANSI C, C++

Server operating systems

Linux

All OS with a Java VM

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

easily portable to other OSs

Data scheme

Schema-free and OWL/RDFS-schema support

schema-free

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

Typing

predefined data types such as float or date

yes

yes, ANSI SQL Types, JSON, typed binary structures

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.

SQL-like query language, no joins

yes, ANSI SQL with proprietary extensions

APIs and other access methods

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

JDBC
MongoDB API
OpenCypher
PostgreSQL wire protocol
Redis API
RESTful HTTP/JSON API
TinkerPop Gremlin

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

Supported programming languages

C++
Java
Python

Java

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

Server-side scripts

Stored procedures

user defined functions and aggregates

yes

.Net, JavaScript, C/C++

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

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

Source-replica replication

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

MapReduce

Offers an API for user-defined Map/Reduce methods

Kerberos/HDFS data loading

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency in MPP-Cluster

Immediate Consistency

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

Foreign keys

Referential integrity

not needed in graphs

yes

relationship in graphs

yes

Transaction concepts

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

ACID

tunable from ACID to Eventually Consistent

Concurrency

Support for concurrent manipulation of data

yes

Durability

Support for making data persistent

yes

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

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

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

AnzoGraph review: A graph database for deep analytics
15 April 2019, InfoWorld

Cambridge Semantics Unveils AnzoGraph DB with Geospatial Analytics
19 June 2020, Solutions Review

AnzoGraph: A W3C Standards-Based Graph Database | by Jo Stichbury
8 February 2019, Towards Data Science

Back to the future: Does graph database success hang on query language?
5 March 2018, ZDNet

Cambridge Semantics Fits AnzoGraph DB with More Speed, Free Access
23 January 2020, Solutions Review

provided by Google News

FairCom kicks off new era of database technology USA - English
10 November 2020, PR Newswire

provided by Google News

Share this page