One solution is to create two copies of the ENROLLMENT file and sort them, as shown in Figure H-2. Be
cause the data are listed in sequential order, this data structure is sometimes called a sequential list.
Sequential lists can be readily stored as sequential files. This solution, however, is not generally support
ed by DBMS products because sequentially reading a file is a slow process. Further, sequential files can
not be updated in the middle without rewriting the entire file. Also, maintaining several orders by keep
ing multiple copies of the same sequential list is usually not effective because the duplicated sequential
list can create data integrity problems. Fortunately, other data structures allow us to process records in
different orders and do not require the duplication of data. These data structures include linked lists and
indexes.
One solution is to create two copies of the ENROLLMENT file and sort them, as shown in Figure H-2. Be
cause the data are listed in sequential order, this data structure is sometimes called a sequential list.
Sequential lists can be readily stored as sequential files. This solution, however, is not generally support
ed by DBMS products because sequentially reading a file is a slow process. Further, sequential files can
not be updated in the middle without rewriting the entire file. Also, maintaining several orders by keep
ing multiple copies of the same sequential list is usually not effective because the duplicated sequential
list can create data integrity problems. Fortunately, other data structures allow us to process records in
different orders and do not require the duplication of data. These data structures include linked lists and
indexes.
การแปล กรุณารอสักครู่..
