New approach for speeding-up technique of the retrieval using dynamic full-text search algorithm

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 are necessary because of the amount of increasing handled document and corresponding document data every day. An adaptive block management algorithm for efficient dynamic data management and speeding up character string retrieval were proposed. This paper proposes a speed-up technique of the retrieval by dynamic full-text search algorithm. Also, the update efficiency of dynamic full-text search system is very high compared with static full-text search system. So, when comparing 200MB registered document using this system speed will be about 426 times higher than static full-text search system. Moreover, this paper presents an efficient achievement method of the dynamic full-text search system for speeding deletion processing time. This experiment proven that the speed for deletion processing time is very high because the deletion of 50 files was 0.2 s or less. © Springer-Verlag Berlin Heidelberg 2005.