An efficient algorithm for full text retrieval for multiple keywords

被引:4
作者
Arita, T [1 ]
Shishibori, M [1 ]
Aoe, JI [1 ]
机构
[1] UNIV TOKUSHIMA, DEPT INFORMAT SCI & INTELLIGENT SYST, TOKUSHIMA 770, JAPAN
关键词
D O I
10.1016/S0020-0255(97)00064-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Text retrieval methods have attracted much interest recently. There are numerous applications involving storage and retrieval of textural data: electronic office filing, computerized libraries, automated law, and so on. A well-known and simple approach of searching texts is full text retrieval using signature files, but the method cannot apply multiple keywords. This paper presents a fast retrieval algorithm for multiple keywords by using the characteristics of multiple signatures. The objective of this approach is to decrease the number of comparisons between multiple signatures. From the simulation result for OR and AND-OR operations and for less than 40 keywords, it is shown that the presented algorithm is from two to six times faster than the traditional algorithm. (C) Elsevier Science Inc. 1998.
引用
收藏
页码:345 / 363
页数:19
相关论文
共 16 条
[1]  
Aho A.V., 1974, The Design and Analysis of Computer Algorithms
[2]   EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].
AHO, AV ;
CORASICK, MJ .
COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340
[3]  
BOYER RS, 1977, COMMUN ACM, V20, P62
[4]   DESIGN CONSIDERATIONS FOR A MESSAGE FILE SERVER [J].
CHRISTODOULAKIS, S ;
FALOUTSOS, C .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1984, 10 (02) :201-210
[5]  
FALOUTSOS C, 1985, ACM COMPUT SURV, V17, P49
[6]  
FRANKES WB, 1992, INFORMATION RETRIEVA
[7]   IMPLEMENTATION OF SUBSTRING TEST BY HASHING [J].
HARRISON, MC .
COMMUNICATIONS OF THE ACM, 1971, 14 (12) :777-&
[8]  
Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024
[9]  
Knuth D. E., 1973, The Art of Computer Programming Volume 3, Sorting and Searching, VIII
[10]  
LEE LG, 1982, COMMUN ACM, V25, P600