Skip Navigation

The Computer Journal 1971 14(3):249-253; doi:10.1093/comjnl/14.3.249
© 1971 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 (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Higgins, L. D.
Right arrow Articles by Smith, F. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Disc access algorithms

L. D. Higgins * and F. J. Smith *

Computer Science Department, The Queen's University of Belfast, Belfast, UK

Disc access algorithms are discussed and compared in the context of on-line document retrieval. Emphasis is placed on algorithms which use the disc space efficiently and which minimise disc accesses, necessary features of viable on-line retrieval systems.

One of the algorithms has been implemented in a pilot study of an interactive subject catalogue for part of the University Library at Belfast. Initial experience with this system is included in the paper.

Received December 1969.

* Computer Science Department, The Queen's University of Belfast, Belfast, N. Ireland


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.