| 摘要 |
<p>When an index is partitioned and managed in a plurality of indexes in a search system which deals with large amounts of data, the number of documents registered in each partitioned index may be varied, and inefficient data transfer may occur at the time of index reconfiguration when search nodes are added or deleted. In the present invention, mapping information is used to map search node IDs to slot regions obtained by equally partitioning a circular hash value space in which a start point and an end point of the hash value space are assumed to be identical, so that each document is mapped to each partitioned index.</p> |
