[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Savannah-hackers] savannah.gnu.org: submission of WB B-tree Associative
From: |
agj |
Subject: |
[Savannah-hackers] savannah.gnu.org: submission of WB B-tree Associative Arrays |
Date: |
Wed, 01 May 2002 23:09:58 -0400 |
A package was submitted to savannah.gnu.org.
This mail was sent to address@hidden, address@hidden
Aubrey Jaffer <address@hidden> described the package as follows:
License: gpl
Other License:
Package: WB B-tree Associative Arrays
System name: wb
This package wants to apply for inclusion in the GNU project
WB is a disk based, sorted associative array C library. WB has an optional
interface to the SCM Scheme implementation which supports SLIB relational
databases.
The WB associative arrays consist of variable length (0 to 255
byte) keys and values. Basic operations are creation, destruction, opening
and closing of diskfiles and arrays, insertion, deletion, retrieval,
successor, and predecessor (with respect to dictionary order of keys). The
put and rem operations allow database records to be used for process
mutexs. Functional application of
find-next, deletion, and modification over a range of
consecutive key values is supported.
Multiple associative arrays can be stored in one disk file.
Simultaneous access to multiple disk files is supported. A program
is provided which checks structure and reclaims unused storage.
The current WB implementation has a file size limit of 2^32 * block size
(default 2048) = 2^43 bytes (8796 Gbytes). WB currently runs with
file sizes of several hundred Megabytes. WB does its own memory and disk
management.
It already exists and you can download the latest distribution at
http://swissnet.ai.mit.edu/ftpdir/scm/wb1a7.zip
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Savannah-hackers] savannah.gnu.org: submission of WB B-tree Associative Arrays,
agj <=