
File processing and management
have to be kept in any order; it can be a straightforward random-access file.
Hashing methods generally have become the topic of intense study, and
there are several books devoted entirely to the subject, though many of these
are aimed at theorists rather than at programmers.
Btree methods
The Btree method is useful when a very large amount of data is held on a
disk, and a record has to be retrieved in the least possible number of disk
read actions. If a file can be held in memory and is sorted into order, the
binary search is very much quicker, because the comparisons take very little
time to perform, and no