The WB B-Tree Database for SCM, Java, C#, C, and C++
WB is a disk based (sorted) associative-array database package providing C, SCM, Java, and C# libraries. These associative arrays consist of variable length (0.B to 255.B) keys and values. Functions are provided to:
WB is thread safe (so long as HAND structures are not shared between threads). The `put' and `rem' operations allow associations to be used for thread mutexs.
The WB implementation has a file size limit of 232 * block size (default 2048.B) = 243 bytes (8796.GB). WB does its own memory and disk management and maintains a RAM cache of recently used blocks. Multiple associative arrays can reside in one disk file. Simultaneous access to multiple disk files is supported.
The (database) disk files interoperate between the various language platforms. The interface to the SCM Scheme implementation supports longer data values and SLIB relational databases.
A structure checking and garbage collecting program and a block viewer are provided.
WB is lightweight; compiled on x64 GNU/Linux, the wb-2b2 library sizes are:
|WB library||file size||file type|
|java/wb.jar||51 kB||Java archive (zipped)|
|csharp/Wb.dll||63 kB||PE for MS Windows (DLL) Mono/.Net assembly|
|c/libwb.so||81 kB||ELF 64-bit LSB shared object, stripped|
|91 kB||ELF 64-bit LSB shared object, not stripped|
|c/libwb.a||131 kB||binary 64-bit library archive|
|c/wbscm.so||113 kB||ELF 64-bit LSB shared object DLL for SCM, not stripped|
WB is implemented using a variant of B-tree structure. B-trees give slower access than hashing but are dynamic and provide an efficient determination of successor and predecessor keys. All operations are O(log(n)) in the size of the database. B-trees are commonly used by database systems for implementing index structures. B-trees are optimized for using the minimum number of disk operations for large data structures. Prefix and suffix key compression are used for storage efficiency in WB.
WB, SLIB, and SCM are GNU packages.
I am a guest and not a member of the MIT Computer Science and Artificial Intelligence Laboratory.
My actions and comments do not reflect in any way on MIT.
|agj @ alum.mit.edu||Go Figure!|