An Estimate of Seek Time for Batched Searching of Random or Index Sequential Structured Files

Open Access
Publisher Website
Google Scholar
Abstract
Schneiderman and Goodman (1976) derived a formula which estimates the portion of a sequential structured file which has to be searched to satisfy a batch of queries. This note addresses a similar problem by assuming that the file (a) is organised either randomly or indexed sequentially, and (b) is placed on a disc with movable read/write heads, and reports a formula which estimates the expected seek time.

This publication has 0 references indexed in Scilit: