About a structure of easily updatable full-text indexes

TL;DR

This paper explores strategies for organizing easily updatable full-text indexes in external memory, analyzing different key types and storage structures to improve proximity search performance.

Contribution

It introduces new methods for structuring external memory indexes for full-text search with various key types, focusing on update efficiency and storage optimization.

Findings

Different key types impact index structure and performance.

Experimental results demonstrate improved proximity search efficiency.

Storage structure depends on key data size.

Abstract

We consider strategies to organize easily updatable associative arrays in external memory. These arrays are used for full-text search. We study indexes with different keys: single word form, two word forms, and sequences of word forms. The storage structure depends on the size of the key's data. The results of the experiments are given in the context of the proximity full-text search, which is performed by means of additional indexes.