Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!columbia!rutgers!ames!hc!beta!unm-la!jay
From: jay@unm-la.UUCP (Jay Plett)
Newsgroups: comp.sources.wanted
Subject: Need database routines
Message-ID: <633@unm-la.UUCP>
Date: Fri, 17-Apr-87 13:43:30 EST
Article-I.D.: unm-la.633
Posted: Fri Apr 17 13:43:30 1987
Date-Received: Sun, 19-Apr-87 12:26:17 EST
Organization: University of New Mexico - Los Alamos
Lines: 25
Keywords: file-based large fast dbm


I am looking for code (preferably) or algorithms for building and
maintaining an arbitrarily large, file-based database of key/data
pairs.  Operations needed are insert, delete, lookup and dump. 
Dumps may be in arbitrary order.  Lookups must be very fast;
other operations should be reasonably fast (ruling out a sorted
database).  Keys will be natural language words (printable
character strings).  Data will be strings of arbitrary bytes. 
Most keys will be <= 12 bytes, but could be >= 30 bytes.  Data
will generally be <= 5 bytes, but could be >= 10 bytes.  Compact
database files are desirable, but subsidiary to the other
criteria.  Cannot use more than 1K or so of core.

I'd like to hear about both public domain or for-purchase, but
must be able to incorporate in a commercial product without
prohibitive royalties.

Sounds like I'm looking for dbm(3)?  Umm, yes, but see above
paragraph (can't buy a SV license just to get dbm).  Thanks for
any pointers!
-- 
	Jay Plett
	UUCP:	{cmcl2,ihnp4}!lanl!unm-la!jay
		{ucbvax,gatech}!unmvax!unm-la!jay
	ARPA:	jxyp@lanl