paul@vixie.UUCP (Paul Vixie Esq) (06/16/87)
1. is NDBM faster than DBM, or does it just do more things?
2. does [N]DBM do better or worse if adding lots of records in SORTED order?
--
Paul A Vixie Esq
329 Noe Street {ptsfa, crash, hoptoad, ucat}!vixie!paul
San Francisco ptsfa!vixie!paul@ames.ames.arc.nasa.gov
CA 94116 paul@vixie.UUCP (415) 864-7013chris@mimsy.UUCP (06/16/87)
In article <662@vixie.UUCP> paul@vixie.UUCP (Paul Vixie Esq) writes: >is NDBM faster than DBM, No. >or does it just do more things? More databases, anyway. It also has a nondestructive store operation (avoids `fetch, make sure null, store'). >does [N]DBM do better or worse if adding lots of records in SORTED order? It makes no noticeable difference what order things are stored. What *would* help is some way of specifying in advance which blocks will be split. This is nontrivial, although simply telling dbm the ultimate size of the database might suffice. -- In-Real-Life: Chris Torek, Univ of MD Comp Sci Dept (+1 301 454 7690) Domain: chris@mimsy.umd.edu Path: seismo!mimsy!chris