Bitsy

Bitsy is a embeddable in-memory graph database that is compatible with Tinkerpop3. It is based on these design principles: "No seek" (avoid disk seeks to maximize write throughput), "No socket" (embed within the application to reduce network/OS delays) and "No SQL" (leverage graph traversals for faster queries).

History

Bitsy was developed in 2013 as a stable implementation of the Tinkerpop API.

Checkpoints

Consistent

The write algorithms are designed to recover from crashes and consolidate work across threads for better performance in OLTP settings. The database can be backed up while it is operational using a JMX interface.

Data Model

Graph

Isolation Levels

Read Committed Repeatable Read

Query Interface

Gremlin

Bitsy can be queried using Gremlin and other Tinkerpop-compatible query languages, like SQL2Gremlin and Pixy.

Storage Architecture

In-Memory

Bitsy maintains a copy of the entire database in-memory. It also maintains a checkpoint of the database on disk.

System Architecture

Embedded

Revision #6  | 
Bitsy Logo
Website

http://www.lambdazen.com/

Source Code

https://github.com/lambdazen/bitsy

Tech Docs

https://github.com/lambdazen/bitsy/wiki

Twitter

@lambdazen

Developer

LambdaZen LLC

Country of Origin

US

Start Year

2013

Project Type

Open Source

Written in

Java

Licenses

Apache v2

Revision #6  |