Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!hacgate!ashtate!dbase!awd
From: awd@dbase.a-t.com (Alastair Dallas)
Newsgroups: comp.databases
Subject: Re: MS-DOS Record Indexing Package
Summary: Old PC Tech Journal
Message-ID: <1991May9.191347.21636@dbase.a-t.com>
Date: 9 May 91 19:13:47 GMT
References: <1991May4.044821.25283@noose.ecn.purdue.edu>
Distribution: usa
Organization: Ashton-Tate, Inc.
Lines: 27

In article <1991May4.044821.25283@noose.ecn.purdue.edu>, dev@ei.ecn.purdue.edu (Larry Weeks) writes:
> Hello,
> 
> I have written a small order-entry/etc. package under MS-DOS/Borland C
> 2.0. All works well... However, the current file searching rate is
> abhorant. ... What I need is an
> indexing package for MS-DOS which will give me fast access on keys, and
> one which can use my existing data structures, i.e. take a pointer to a
> struct for data. If anybody has any suggestions, I would be very much
> obliged.

If you can find a library which has back issues of PC Tech Journal, you're
in luck.  I was fairly impressed by "Tree Structures: A tutorial on using
tree structures for random data storage and retrieval," by Atindra Chaturvedi
in PC Tech Journal, February and March, 1985.  Part 2, in March, includes
C source code.  It's probably all you need for your application and its
virtually free.

BTW, just to squander bandwidth: I miss PC Tech Journal, damn it. :-)

/alastair/

-- 
|Disclaimer: I am speaking for myself, not as a spokesman for Ashton-Tate,
|which does not monitor my outbursts here.  I reserve all rights to my
|opinions in terms of commercial endorsements.