SkipDB is a BerkeleyDB style (ordered key/value pair) database implemented with a skip lists instead of b-tree.
- Features
-
- small (~5000 lines of code)
- transactional
- fast (appears to be faster than SleepyCat for individual transactional writes)
- Notes
This is an alpha release, so it has not been well tested. Please send me your bugs reports, comments, suggestions, etc. Also, I'll be adding support for cursors in a future release.
- Credits
Thanks to Bill Pugh for developing Skip Lists and for Greg Burd for recommending checking them out.
- Steve Dekorte steve at dekorte dot com