Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!rex!ukma!usenet.ins.cwru.edu!ncoast!allbery
From: allbery@NCoast.ORG (Brandon S. Allbery KB8JRR/AA)
Newsgroups: comp.lang.perl
Subject: Re: Pattern matching of a large dbm file (slow indexing)
Message-ID: <1991May7.232233.12448@NCoast.ORG>
Date: 7 May 91 23:22:33 GMT
References: <1991May6.163310.21805@ccu.umanitoba.ca> <1991May6.223013.7274@iwarp.intel.com> <22673@yunexus.YorkU.CA>
Reply-To: allbery@ncoast.ORG (Brandon S. Allbery KB8JRR/AA)
Followup-To: comp.lang.perl
Organization: North Coast Public Access Un*x (ncoast)
Lines: 22

As quoted from <22673@yunexus.YorkU.CA> by oz@yunexus.yorku.ca (Ozan Yigit):
+---------------
| Brandon S. Allbery writes:
| 
| > Standard dbm is slow.
| 
| So, I can only assume that when you say standard dbm is slow, you really
| mean a sequential pass over a database, which dbm is *not* designed for,
| is slow.
+---------------

I mean that *general* database operations, such as the original poster is
asking for, are slow.  dbm/ndbm have their place, but that place isn't and
isn't intended to be as a replacement for a regular database manager.  Or for
sequential or relative access files.

++Brandon
-- 
Me: Brandon S. Allbery			  Ham: KB8JRR/AA  10m,6m,2m,220,440,1.2
Internet: allbery@NCoast.ORG		       (restricted HF at present)
Delphi: ALLBERY				 AMPR: kb8jrr.AmPR.ORG [44.70.4.88]
uunet!usenet.ins.cwru.edu!ncoast!allbery       KB8JRR @ WA8BXN.OH