Path: utzoo!utgpu!news-server.csri.toronto.edu!helios.physics.utoronto.ca!ists!yunexus!oz From: oz@yunexus.yorku.ca (Ozan Yigit) Newsgroups: comp.sources.wanted Subject: Re: PD or commercial NDBM(3x) for SYSV? Message-ID: <22035@yunexus.YorkU.CA> Date: 19 Mar 91 16:05:20 GMT References: <40206@cup.portal.com> <21906@yunexus.YorkU.CA> Sender: news@yunexus.YorkU.CA Organization: York U. Communications Research & Development Lines: 18 In article emv@ox.com (Ed Vielmetti) writes: >oz, do any of the alternatives to gdbm that you mention (sdbm, >berkeley hash) have support for arbitrary sized key,value pairs? Ed, Berkeley hash supports arbitrary sized key,value pairs, and is capable of dealing with byte-order differences. It is also faster than dbm/ndbm and any existing clones out there. >don't you just hate arbitrary limits? I do, but well, um, sometimes it is not that easy to come up with reasonable software alternatives without those limits. oz --- Not all good things come with three | internet: oz@nexus.yorku.ca pages of dogma and an attitude. - anon | uucp: utzoo/utai!yunexus!oz