An efficient block structure for incremental inverted indexing

Inverted index is a key component in a search engine. Due to the high update frequency of web pages, incremental inverted index is commonly used in modern web-based search engine. In order to improve the performance of search engine, an efficient data block and control block DB&CB structure for incremental inverted index is proposed. Theoretical analysis and experiment results show that the average complexities of posting lists´ append, insert and delete operations are O(1), the average inverted index construction time is reduced by 37% comparing with the linked block data structure and the query processing performance is as good as others.