  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.
