Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!caen!ox.com!ox.com!emv From: emv@ox.com (Ed Vielmetti) Newsgroups: comp.sources.wanted Subject: Re: PD or commercial NDBM(3x) for SYSV? Message-ID: Date: 18 Mar 91 07:00:33 GMT References: <40206@cup.portal.com> <21906@yunexus.YorkU.CA> Sender: usenet@ox.com (Usenet News Administrator) Organization: OTA Limited Partnership, Ann Arbor MI. Lines: 17 In-Reply-To: oz@yunexus.yorku.ca's message of 18 Mar 91 05:07:58 GMT In article <21906@yunexus.YorkU.CA> oz@yunexus.yorku.ca (Ozan Yigit) writes: There is also something called gdbm. oz oz, do any of the alternatives to gdbm that you mention (sdbm, berkeley hash) have support for arbitrary sized key,value pairs? that's the primary attraction of gdbm right now. (don't you just hate arbitrary limits?) -- Msen Edward Vielmetti /|--- moderator, comp.archives emv@msen.com