Skip Navigation

The Computer Journal 1979 22(3):206-208; doi:10.1093/comjnl/22.3.206
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Burton, F. W.
Right arrow Articles by Kollias, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimising disc head movements in secondary key retrievals

F. W. Burton1 * and J. Kollias2 §

1 School of Computing Studies, University of East Anglia, Norwich, UK, 2 Dimitriou Ralli 46, Amarousion, Athens, Greece

Schneiderman and Goodman (1976) considered queries based on primary key values and they argued that the process of batching may reduce their response time. This study considers the effect of batching queries based on secondary key values and proposes some means of scheduling the queries which substantially reduces the required disc head movements. The method is a variation of the SCAN disc scheduling policy and it can be applied to online retrieval systems because it works even for very small batch sizes and because it does not impose prohibitive overheads in evaluating/implementing it.

Received January 1978.

* now at School of Computing Studies, University of East Anglia, Norwich NR4 7TJ.

§ Dimitriou Ralli 46, Amarousion, Athens, Greece.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.