![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Full-text search is widely used for various services of the Internet. A more high-speed and a more efficient full-text search technology is necessary because of the amount of increasing handled document and corresponding document data every day. This paper proposes an adaptive block management algorithm that is efficient for dynamic data management method. This algorithm is applied for inverted file searching. The new method speeds up character string retrieval by first making a full-text search of uni-gram and a full-text search of bi-gram. This paper proposes a method for enhancing the static full-text search system of bi-gram to the dynamic full-text search system of bi-gram. Moreover, this paper presents an efficient achievement method of the dynamic full-text search system of bi-gram using effectiveness of the adaptive block management structure.