Memory Management Strategies for Single-Pass Index Construction in Text Retrieval Systems
Badura Štefan, Charles L. A. Clarke · 2005
Many text retrieval systems construct their index by accumulating postings in main memory until there is no more memory available and then creating an on-disk index from the in-memory data. When the entire text collection has been read, all on-disk indices are combined into one big index through a multiway merge process. This paper discusses several ways to arrange postings in memory and studies the eects on memory requirements and indexing performance. Starting from the traditional approach that holds all postings for one term in a linked list, we examine strategies for combining consecutive postings into posting groups and arranging these groups in a linked list in order to reduce the number of pointers in the linked list. We then extend these techniques to compressed posting lists and nally evaluate the eects they have on overall indexing performance for both static and dynamic text collections. Substantial improvements are achieved over the initial approach.