DBMS > AnzoGraph DB vs. FatDB vs. Oracle Berkeley DB vs. SQLite

System Properties Comparison AnzoGraph DB vs. FatDB vs. Oracle Berkeley DB vs. SQLite

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

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

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

Widely used in-process key-value store

Widely used embeddable, in-process RDBMS

Primary database model

Graph DBMS
RDF store

Document store
Key-value store

Key-value store

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

Relational DBMS

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

Score	0.23
Rank	#307	Overall
	#24	Graph DBMS
	#13	RDF stores

Score	2.21
Rank	#117	Overall
	#20	Key-value stores
	#3	Native XML DBMS

Score	114.32
Rank	#10	Overall
	#7	Relational DBMS

Website

cambridgesemantics.com/anzograph

www.oracle.com/database/technologies/related/berkeleydb.html

www.sqlite.org

Technical documentation

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

docs.oracle.com/cd/E17076_05/html/index.html

www.sqlite.org/docs.html

Developer

Cambridge Semantics

FatCloud

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Dwayne Richard Hipp

Initial release

2018

2012

1994

2000

Current release

2.3, January 2021

18.1.40, May 2020

3.45.3 (15 April 2024), April 2024

License

Commercial or Open Source

commercial

free trial version available

commercial

Open Source

commercial license available

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

C, Java, C++ (depending on the Berkeley DB edition)

Server operating systems

Linux

Windows

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

server-less

Data scheme

Schema-free and OWL/RDFS-schema support

schema-free

yes

dynamic column types

Typing

predefined data types such as float or date

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.

yes

only with the Berkeley DB XML edition

Secondary indexes

yes

SQL

Support of SQL

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

Via inetgration in SQL Server

yes

SQL interfaced based on SQLite is available

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

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

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

Supported programming languages

C++
Java
Python

.Net

Figaro is a .Net framework assembly that extends Berkeley DB XML into an embeddable database engine for .NET
others

Third-party libraries to manipulate Berkeley DB files are available for many languages
C
C#
C++
Java
JavaScript (Node.js)

3rd party binding
Perl
Python
Tcl

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

via applications

Triggers

yes

via applications

yes

only for the SQL API

yes

Partitioning methods

Methods for storing different data on different nodes

Automatic sharding

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication in MPP-Cluster

selectable replication factor

Source-replica replication

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Kerberos/HDFS data loading

yes

Consistency concepts

Methods to ensure consistency in a distributed system

Immediate Consistency in MPP-Cluster

Eventual Consistency
Immediate Consistency

Foreign keys

Referential integrity

not needed in graphs

yes

Transaction concepts

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

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

Durability

Support for making data persistent

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

Can implement custom security layer via applications

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.