Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
