Skip Navigation

The Computer Journal 1977 20(2):116-123; doi:10.1093/comjnl/20.2.116
© 1977 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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by McDonell, K. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An inverted index implementation

K. J. McDonell *

Department of Information Science, Monash University, Clayton, Victoria, Australia

A working implementation of an inverted index suitable for real time applications is described. Based upon a hash addressed random access organization with variable length records, the index structure and processing algorithms were developed with the aid of a simulation model. Some typical simulation results are presented and critical parameters identified. One solution to the inverted key identification problem is proposed, although a severe time penalty accrues from designing software which is not directly dependent upon the main file record format.

Received August 1975.

* Department of Information Science, Monash University, Clayton, Victoria 3168, Australia*

§ Present address: Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1


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.