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
Workable is the preferred software for today's recruiting industry and HR teams, trusted by over 6,000 companies to streamline their hiring processes. Finding the right person for the job has never been easier—users now possess the ability to manage multiple hiring pipelines at once, from posting a job to sourcing candidates. Workable is also seamlessly integrated between desktop and mobile, allowing admins full control and flexibility all in the ATS without needing additional software.
Rate This Project
Login To Rate This Project
User Reviews
-
Cl-btree works excellent.