Hide Login/Register to vote and to have access to more features

You are here: Root > By Topic > Data structures

View the dependency graph for this library

cl-btree
Created by smo on: Mon, 28 Nov 2011 19:39:48 GMT, Last modification: Mon, 28 Nov 2011 19:39:48 GMT

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL.

eMail
Web site	http://sourceforge.net/projects/cl-btree/
Mailing list
Version	0.12 -
Maturity	Alpha
OS compatibility
ASDF installable	Yes
Official Download	http://sourceforge.net/projects/cl-btree/files/cl-btree_0.12.tgz
Mirrored Download
Source code repository	https://cl-btree.svn.sourceforge.net/svnroot/cl-btree

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)

API description available here.

Tags

Data structures | Database | ASDF installable | MIT | Common Lisp

0 Notes and 0 comments