dev@ei.ecn.purdue.edu (Larry Weeks) (05/04/91)
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. I have little to no experience with efficient record indexing algorithms on an external file system, but nevertheless have installed a rather primitive indexing method of my own, simply searching a sequential file of keys and file offsets. Not pretty. 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. I would like to obtain a rather inexpensive Borland-compatible C library if possible, since this package will be installed at most at one site. Thanks a lot. Larry dev@ecn.purdue.edu
drezac@dcsc.dla.mil (Duane L. Rezac) (05/08/91)
From article <1991May4.044821.25283@noose.ecn.purdue.edu>, by dev@ei.ecn.purdue.edu (Larry Weeks): > Hello, > ( Stuff Deleted...).>.... 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. I would like to obtain a rather inexpensive Borland-compatible > C library if possible, since this package will be installed at most at > one site. > > Thanks a lot. > > Larry > dev@ecn.purdue.edu Take a look at the Bplus package. it is available on Simtel20 (and it's mirror sites) under the "C" directory. It contains functions to manipulate a btree index. It's easy to use - just give it the key and a pointer to the record, and it does the rest. Duane L. Rezac -- Verse of the Hour: But whosoever shall deny me before men, him will I also deny before my Father which is in heaven. Matt. 10:33 -- +-----------------------+---------------------------------------------------+ | Duane L. Rezac |These views are my own, and NOT representitive of my place| | dsacg1!dcscg1!drezac drezac@dcscg1.dcsc.dla.mil of Employment. | +-----------------------+---------------------------------------------------+
awd@dbase.a-t.com (Alastair Dallas) (05/10/91)
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.