论文标题
关于易于更新的全文索引的结构
About a structure of easily updatable full-text indexes
论文作者
论文摘要
我们考虑在外部内存中组织易于更新的关联阵列的策略。这些阵列用于全文搜索。我们使用不同的键研究索引：单词形式，两个单词形式和单词形式的序列。存储结构取决于密钥数据的大小。实验的结果是在接近全文本搜索的上下文中给出的，该搜索是通过其他索引执行的。
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.
