Hamlet Temp Title

1
Chapter Eight, Figures 1-10 File Structures
Computer Science An Overview J. Glenn
Brookshear
2
Figure 8.1Maintaining a files order by means of
a file allocation table
3
Figure 8.2A procedure for merging two sequential
files
4
Figure 8.3 (A)Applying the merge alorithm
(Letters are used to represent entire records.
The particular letter indicates the value of the
records key field.)
5
Figure 8.3 (B)Applying the merge alorithm
(Letters are used to represent entire records.
The particular letter indicates the value of the
records key field.)
6
Figure 8.3 (C)Applying the merge alorithm
(Letters are used to represent entire records.
The particular letter indicates the value of the
records key field.)
7
Figure 8.4Updating a text file
8
Figure 8.5An inverted file
9
Figure 8.6A file with a partial index
10
Figure 8.7The rudiments of a hashing system, in
which each bucket holds those records that hash
to that bucket number
11
Figure 8.8Hashing the key field value 25X3Z to
one of 40 buckets
12
Figure 8.9Handling bucket overflow
13
Figure 8.10A large file partitioned into buckets
to be accessed by hashing