A sequential file is designed for efficient processing of records in sorted order on some search key . Records are chained together by pointers to permit fast retrieval in search key order.
Pointer points to next record in order.
This minimizes number of block accesses. Figure 10.15 shows an example, with bname as the search key. It is difficult to maintain physical sequential order as records are inserted and deleted. Deletion can be managed with the pointer chains. Insertion poses problems if no space where new record should go.