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).
- Source Code
- https://github.com/lambdazen/bitsy[02]
- Developer
- Country of Origin
- US
- Start Year
- 2013
- Project Type
- Open Source
- Written in
- Java
- License
- Apache v2
- @lambdazen[04]
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
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.
Query Interface
Bitsy can be queried using Gremlin and other Tinkerpop-compatible query languages, like SQL2Gremlin and Pixy.
Storage Architecture
Bitsy maintains a copy of the entire database in-memory. It also maintains a checkpoint of the database on disk.
Citations
5 sources- LambdaZen | Your Partner in AI Transformation lambdazen.com
- GitHub - lambdazen/bitsy: Bitsy Graph Database v3 · GitHub github.com
- Home · lambdazen/bitsy Wiki · GitHub github.com
- https://twitter.com/lambdazen twitter.com
- lambdazen / bitsy — Bitbucket bitbucket.org