File Systems: Structures and AlgorithmsThis book is intended as a textbook for a one-semester course in file systems. The course is similar in content to the ACM curriculum '78 course CS 5, but differs in that a course in data structures is assumed as a prerequisite. Many of the standard topics of a data structures course are either directly applicable to file system problems, or are very similar to the structures and algorithms used in file systems, making a good foundation for the study of files. A data structure is defined, then algorithms and applications are discovered that are appropriate to the structure. File systems is a natural extension of data structures both in subject matter and methods. |
Contents
BASIC FILE CONCEPTS | 1 |
INDEXED SEQUENTIAL FILES | 8 |
THE CONSTRAINTS OF PHYSICAL DEVICES | 9 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
added B-tree Bik Bik Bik binary search block size blocking factor bucket buffer bytes calculate chaining without replacement change file course record file currency pointer cylinder Data Data Data data file data pointer direct access file disk empty slot end-of-file entity entries example extendible hash file design file system file types givenkey grade reports H(key hashing function homogeneous tree index block index node indexed sequential file indx integer key order key value leaf node linear probing load factor locate magnetic tape memory-mapped file method natural address null number of levels number of physical number of records number of students ordered relative file parameters physical accesses primary key primary memory primitive operations procedure Read all records READ-DIRECT recbuf record number Registration reorganization retrieval Section sector sequential-chronological file Sets the currency shown in Figure solution storage student record file student records problem track unsuccessful search Update VALID file WRITE-DIRECT