THE B-PLUS PROGRAM
A B-TREE INDEXING FILE MODULE
FOR C PROGRAMMERS
by
Hunter and Associates
B-PLUS is a versatile, carefully designed module for C
programmers who need a fast, efficient program for indexing
data files. B-PLUS allows data records to be retrieved based
on a key value without regard to their position in the data
file. The data records can also be accessed in sequential
order in either a forward and reverse direction.
The B-PLUS Program Module is based on the famous and
widely used b-tree algorithm and has a number of useful
extensions which are not found in many programs of this type.
Some of its features are the following:
- Variable length keys are allowed
- File size limited only by DOS or by disk space
- All functions are non-recursive so very little stack
space is required
- The most recently used key values are stored in a
cache buffer in main memory for fast access
- Duplicate keys are allowed
The B-PLUS program has been tested using the Microsoft C
Compiler, Versions 4.0 and 5.0 (Beta), and the Borland Turbo
C Compiler Version 1.0. The compiled object file is less
than 9.4K bytes in length for these compilers.
LICENSE AND REGISTRATION
B-PLUS is distributed as a "shareware" program. Please
help us get it known by giving unmodified copies of the
program and documentation to other programmers who may find
B-PLUS useful.
B-PLUS is copyright (C) 1987 by Hunter and Associates.
It is not public domain or free software. Non-registered
