By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yamamoto, H. ; Software Div., Hitachi Ltd., Osaka, Japan ; Ohmi, S. ; Tsuji, H.

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.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:5 )

Date of Conference:

5-8 Oct. 2003