A method and device for index hot loading based on advertisement placement

Abstract

Embodiments of the present invention provide an index hot loading method and device based on advertisement placement. The advertisement placement based index hot loading method includes: segmenting a directory bitmap file into regions to obtain multiple index blocks; the directory bitmap The map file is an advertising plan index table formed by multiple advertising materials and multiple advertising conditions, and each index block includes a different advertising plan; when updating the directory bitmap file, each index block corresponding to backup index blocks; using each backup index block to update the corresponding index block in the directory bitmap file successively. By dividing the directory bitmap file into regions, multiple index blocks are obtained, and then a backup index block is rebuilt each time, which can greatly reduce the memory usage, and after the construction is completed, the backup index block replaces the directory bitmap file In the process of replacing and updating the corresponding index block, the retrieval of other index blocks is not affected, thereby ensuring the retrieval performance.

Description

technical field [0001] The present invention relates to the technical field of advertisement indexing, in particular to an index hot loading method and device based on advertisement placement. Background technique [0002] In the prior art, the retrieval of basic directional conditions when implementing an advertisement delivery system is usually indexed by means of a directory bitmap file bitmap. Using this type of data structure to construct an index basically meets the requirements of delivery data volume and delivery performance in the field of advertising. However, since the bitmap index will pre-open a piece of memory for storage at the beginning of its establishment, if the index is updated in large quantities, there will be a risk of dirty reads or program crashes in a multi-threaded environment, and it is necessary to add a mutex to ensure data consistency. In this way, index retrieval operations will be affected when updating indexes in large batches. Therefore, t...

AI Technical Summary

Problems solved by technology

[0004] In the first method, the advertising indexing service has multiple nodes, and each node needs to be restarted in turn each time to ensure that the online retrieval service is highly available when updating the index. Difference

[0005] In the second method, the index is rebuilt by creating a backup bitmap. If the amount of data in the advertising plan is large, it will cause huge memory overhead to store two bitmap data at the same time, and the memory redundancy is twice that of the general system.

[0006] In the process of implementing the present invention, the inventor found that there are at least the following problems in the prior art: it is impossible to guarantee that the retrieval index will not be affected when the index is updated, and the memory usage should be controlled as much as possible

Images