CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

WB: Database package which may be used with SCM.

lang/scheme/impl/scm/wb/
WB is a disk based, sorted associative array (B-tree) C library. These associative arrays consist of variable length (less that 256 bytes) keys and values. Using WB, large databases can be created and managed from SCM. 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). 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 structure checker, garbage collector are included. A repair program and ram-disk type file (for temporary structures) are in development. The current WB implementation has a file size limit of 2^32 * block size (default 2048) = 2^43 bytes (8796 Gbytes). WB does its own memory and disk management.
Origin:   

   swiss-ftp.ai.mit.edu:/archive/scm/
   prep.ai.mit.edu:/pub/gnu/jacal/
   cs.indiana.edu:/pub/scheme-repository/new/,
   ftp.maths.tcd.ie:/pub/bosullvn/jacal/

Version: 1a2 Requires: SCM Copying: Copyright (c) 1991, 1992, 1993 Holland Mark Martin Use, copying, modification, and distribution permitted for educational, research, and non-profit purposes. (See the readme.txt file for details.) Updated: Thu Nov 10 23:14:40 1994 CD-ROM: Prime Time Freeware for AI, Issue 1-1 Bug Reports: jaffer@ai.mit.edu Author(s): Aubrey Jaffer, Jonathan Finger, and Roland Zito-Wolf Contact: Jonathan Finger Holland Mark Martin 174 Middlesex Turnpike Burlington, MA 01803-4467 Keywords: Authors!Finger, Authors!Jaffer, Authors!Zito-Wolf, Database Package for SCM, Programming Languages!Scheme, SCM, Scheme!Implementations, WB References: ?
Last Web update on Mon Feb 13 10:38:07 1995
AI.Repository@cs.cmu.edu