We describe an integrated disk and file design, called IIS, and present algorithms for processing operations using this design. The operations include sequential and random retrieval, range queries, insertion, deletion, and get next record. We analyze the disk space requirements of IIS files, and the primary memory requirements. We analyze the time requirements for the various operations and give results for some examples. We show that IIS files provide 1-access random retrieval with a small transfer time, very fast sequential retrieval, efficient insertion and deletion, good storage utilization, and low primary memory requirements. We show that the IIS design is potentially superior to other popular file organizations for a wide range of realistic applications using modern technology.