Abstract
Currently the emphasis is laid on the update rate of indices working with huge data sets, e.g. with all the Internet pages. This article addresses the questions of inverted indices generation, of static data structures dynamization and finally of dynamic index distribution on more nodes.
In each step of upgrading such data structures we describe what changes have to be done and describe benefits (eventually disadvantages) of recently developed data structures. The goal of this paper is to show experimentally that a dynamic inverted index updating distributed to more nodes is quicker then a static one and we can save up to tens percent of read and write operations.