An example of a B-tree appears in Figure H-9, and an occurrence of this structure can be seen in Figure
H-10. Notice that the bottom row in Figure H-9, the sequence set, is simply an index. It contains an entry
for every record in the file (although for brevity, both the data records and their addresses have been
omitted). Also, notice that the sequence set entries are in groups of three. The entries in each group are
physically in sequence, and each group is chained to the next one by means of a linked list, as can be
seen in Figure H-10.
An example of a B-tree appears in Figure H-9, and an occurrence of this structure can be seen in Figure H-10. Notice that the bottom row in Figure H-9, the sequence set, is simply an index. It contains an entry for every record in the file (although for brevity, both the data records and their addresses have been omitted). Also, notice that the sequence set entries are in groups of three. The entries in each group are physically in sequence, and each group is chained to the next one by means of a linked list, as can be seen in Figure H-10.
การแปล กรุณารอสักครู่..
