Experimental simulation on incremental three-gram index for two-gram full-text search systems

N-gram indexing method is an algorithm for the full text search system where each index consists of serial N characters. To save the volumes of index file, the system has 2-gram index as base and to improve the performance, it has higher-gram index as supplement. This paper describes the performance of the incremental 3-gram index for the first step based on the search term intensive approach. Experimentation includes four index patterns and four search cases.