Issue No. 10 - October (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.59856
<p>The problem of minimizing the average time to search for a key in a stored list of keys in a sequential access machine model (SAM) (e.g. a magnetic tape) is considered. The time to access a key in the list and the time to compare it to the given search key are taken into account. The time to access a key in the list is assumed proportional to the distance the head moves from its current location to reach the key. The time to read and compare the key to the search key is taken to be constant. Two classes of algorithms are analyzed and a matching lower bound on the average search time is presented. These results answer an open problem posed by S. Nishihara and H. Nishino (1987) regarding the optimal search algorithm for such a model. It is shown that the organization of the input data is crucial in determining the SAM complexity of the search problem.</p>
key search; key access; key comparison; input data organisation; stored list; sequential access machine model; magnetic tape; search key; head; read; lower bound; average search time; optimal search algorithm; SAM complexity; search problems.
S.S. Skiena, E.P. Mucke, S.R. Maddila, S.W. Hornick, H. Rosenberger, I.G. Tollis, "Searching on a Tape", IEEE Transactions on Computers, vol. 39, no. , pp. 1265-1272, October 1990, doi:10.1109/12.59856