Sequential File Organization
Suitable for applications that require sequential processing of
the entire le
The records in the le are ordered by a search-key.
Deletions of records are managed using pointer chains.
Insertions { must locate the position in the le where the
record is to be inserted
{ if there is free space, insert the record there
{ if no free space, insert the record in an over
ow block
{ in either case, pointer chain must be updated
If many record modications (in particular insertions and
deletions), correspondence between search key order and
physical order can be totally lost =) le reorganization