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
Other Useful Business Software
Orchestrate Your AI Agents with Zenflow
Zenflow orchestrates AI agents like a real engineering system. With parallel execution, spec-driven workflows, and deep multi-repo understanding, agents plan, implement, test, and verify end-to-end. Upgrade to AI workflows that work the way your team does.
Rate This Project
Login To Rate This Project
User Reviews
-
Cl-btree works excellent.