B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.
Features
- supports both integer (32-bit) and variable size string keys/values.
- with string B-tree anything readable can be used as keys/values.
- uses write ahead log as a journal.
- no explicit threading support, locking must be handled externally.
- mapping keys/values support lower (inclusive) and upper (exclusive) bound
- supports both unique and non-unique values.
- read-only cursor
- in-memory B-tree (for testing)
License
MIT LicenseFollow cl-btree
You Might Also Like
La version gratuite d'Auth0 s'enrichit !
Vous l'avez demandé, nous l'avons fait ! Les versions gratuite et payante d'Auth0 incluent des options qui vous permettent de développer, déployer et faire évoluer vos applications en toute sécurité. Utilisez Auth0 dès maintenant pour découvrir tous ses avantages.
Rate This Project
Login To Rate This Project
User Reviews
-
Cl-btree works excellent.