Paper:
Views over last 60 days: 673
A Fast Dynamic Full-Text Search Method Using Efficient Block Management Structure
Masao Fuketa, El-Sayed Atlam, Elmarhomy Ghada, and Jun-ichi Aoe
Department of Information Science and Intelligent Systems, University of Tokushima
Tokushima 770-8506, Japan
Received:July 20, 2004Accepted:September 12, 2004Published:November 20, 2004
Keywords:full-text search, inverted file search, Uni-gram index, Bi-gram index, adaptive block management
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. 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 is speeding up character string retrieval by first making the full-text search of Uni-gram and by the full-text search of Bi-gram. This paper proposes a method of 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.
Cite this article as:M. Fuketa, E. Atlam, E. Ghada, and J. Aoe, “A Fast Dynamic Full-Text Search Method Using Efficient Block Management Structure,” J. Adv. Comput. Intell. Intell. Inform., Vol.8 No.6, pp. 573-581, 2004.Data files:
