Sequential vs. random retrieval of a large indexed file

DOI10.1080/00949657908810346MaRDI QIDQ3870346zbMATH OpenOpenAlexFDO

Authors William W. Lau

Publication date 1979

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949657908810346

zbMATH Keywords

average total seek timescomparison of sequential and random access methodsindexed sequential file

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Cites work

• Analysis of Internal Computer Sorting
• scientific article; zbMATH DE number 3650042 (Why is no real title available?)
• scientific article; zbMATH DE number 3174818 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)

This page was built for publication: Sequential vs. random retrieval of a large indexed file

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870346)