DBMS > Geode vs. Oracle Berkeley DB vs. SQLite vs. TinkerGraph

System Properties Comparison Geode vs. Oracle Berkeley DB vs. SQLite vs. TinkerGraph

Please select another system to include it in the comparison.

Editorial information provided by DB-Engines

Name

Description

Geode is a distributed data container, pooling memory, CPU, network resources, and optionally local disk across multiple processes

Widely used in-process key-value store

Widely used embeddable, in-process RDBMS

A lightweight, in-memory graph engine that serves as a reference implementation of the TinkerPop3 API

Primary database model

Key-value store

supports sorted and unsorted key sets
Native XML DBMS

in the Oracle Berkeley DB XML version

Relational DBMS

Graph DBMS

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

Score	1.51
Rank	#147	Overall
	#25	Key-value stores

Score	1.88
Rank	#130	Overall
	#23	Key-value stores
	#3	Native XML DBMS

Score	103.35
Rank	#10	Overall
	#7	Relational DBMS

Score	0.08
Rank	#345	Overall
	#34	Graph DBMS

Website

geode.apache.org

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

www.sqlite.org

tinkerpop.apache.org/docs/current/reference/#tinkergraph-gremlin

Technical documentation

geode.apache.org/docs

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

www.sqlite.org/docs.html

Developer

Originally developed by Gemstone. They outsourced the project to Apache in 2015 but still deliver a commercial version as Gemfire.

Oracle

originally developed by Sleepycat, which was acquired by Oracle

Dwayne Richard Hipp

Initial release

2002

1994

2000

2009

Current release

1.1, February 2017

18.1.40, May 2020

3.46.1 (13 August 2024), August 2024

License

Commercial or Open Source

Open Source

Apache Version 2; commercial licenses available as Gemfire

Open Source

commercial license available

Open Source

Public Domain

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

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

Java

Server operating systems

All OS with a Java VM

the JDK (8 or later) is also required

AIX
Android
FreeBSD
iOS
Linux
OS X
Solaris
VxWorks
Windows

server-less

Data scheme

schema-free

yes

dynamic column types

schema-free

Typing

predefined data types such as float or date

yes

not rigid because of 'dynamic typing' concept.

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.

yes

only with the Berkeley DB XML edition

Secondary indexes

yes

SQL

Support of SQL

SQL-like query language (OQL)

yes

SQL interfaced based on SQLite is available

yes

SQL-92 is not fully supported

APIs and other access methods

Java Client API
Memcached protocol
RESTful HTTP API

ADO.NET

inofficial driver
JDBC

inofficial driver
ODBC

inofficial driver

TinkerPop 3

Supported programming languages

.Net
All JVM based languages
C++
Groovy
Java
Scala

.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

Groovy
Java

Server-side scripts

Stored procedures

user defined functions

Triggers

yes

Cache Event Listeners

yes

only for the SQL API

yes

Partitioning methods

Methods for storing different data on different nodes

Sharding

none

Replication methods

Methods for redundantly storing data on multiple nodes

Multi-source replication

Source-replica replication

none

MapReduce

Offers an API for user-defined Map/Reduce methods

Consistency concepts

Methods to ensure consistency in a distributed system

Eventual Consistency

none

Foreign keys

Referential integrity

yes

Relationships in graphs

Transaction concepts

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

yes, on a single node

ACID

Concurrency

Support for concurrent manipulation of data

yes

via file-system locks

Durability

Support for making data persistent

yes

optional

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 per client and object definable

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.