About a structure of easily updatable full-text indexes
This work addresses the problem of efficient full-text search updates for users needing dynamic indexing, but it appears incremental as it builds on existing strategies.
The paper tackled the problem of organizing easily updatable associative arrays in external memory for full-text search, and the result was that experiments showed performance in proximity full-text search using additional indexes, though no concrete numbers were provided.
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.