[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#464952: marked as done (RFP: wb -- disk-based associative array library for C, SCM, Java, and C#)

Your message dated Fri, 12 Aug 2016 09:56:24 +0000
with message-id <E1bY9CS-0001vi-9x@quantz.debian.org>
and subject line closing RFP: wb -- disk-based associative array library for C, SCM, Java, and C#
has caused the Debian Bug report #464952,
regarding RFP: wb -- disk-based associative array library for C, SCM, Java, and C#
to be marked as done.

This means that you claim that the problem has been dealt with.
If this is not the case it is now your responsibility to reopen the
Bug report if necessary, and/or fix the problem forthwith.

(NB: If you are a system administrator and have no idea what this
message is talking about, this may indicate a serious mail system
misconfiguration somewhere. Please contact owner@bugs.debian.org
immediately.)


-- 
464952: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=464952
Debian Bug Tracking System
Contact owner@bugs.debian.org with problems
--- Begin Message --- 
Package: wnpp
Severity: wishlist



"WB" is a disk based (sorted) associative-array package with 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:

   * create, destroy, open and close disk-files and associative arrays;

   * insert, delete, retrieve, find next, and find previous (with
     respect to dictionary order of keys); and

   * The atomic `put' and `rem' operations allow associations to be
     used for process mutexs.

   * apply functions, delete, or modify values over a range of
     consecutive key values.

The (database) disk files interoperate between the various language
libraries.  The interface to the SCM Scheme implementation supports
longer data values and SLIB relational databases.

The WB implementation has a file size limit of 2^32 * block size
(default 2048.B) = 2^43 bytes (8796.GB).  WB routinely runs with
databases of several hundred Megabytes.  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.  A structure checking and
garbage collecting program and a viewer are provided.  Compiled, WB
occupies approximately 66 kilobytes.

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 is free software and part of the GNU project.  It is released under
the GNU Lesser General Public License (LGPL).

Documentation and distributions in several formats are linked from
WB's home page:

             http://swissnet.ai.mit.edu/~jaffer/WB.html

--- End Message ---
--- Begin Message --- 
RFP 464952 has no visible progress for a long time, so closing.

--- End Message ---
Reply to: