Skip Navigation

The Computer Journal 1982 25(2):169-175; doi:10.1093/comjnl/25.2.169
© 1982 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Johnson, J. S.
Right arrow Articles by Webster, D. B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Updating an Inverted Index—a Performance Comparison of Two Techniques

J. S. Johnson * and D. B. Webster *

Department of Industrial Engineering, Auburn University, Auburn, Alabama, USA

On-line maintenance for an inverted index file of a volatile database is one of many performance questions to be considered when designing an information system. An alternate method of file maintenance for an inverted index file is proposed that can reduce the amount of execution time and the number of input/output operations as compared with the traditional technique. Both techniques were implemented and their performance compared on a dedicated computer. The results indicate what levels of update activity are needed to realize improved performance using the proposed technique.


Received December 1979.

* Department of Industrial Engineering, Auburn University, Auburn, Alabama 36849, USA


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.