n-Gram/2L索引结构的存储与时间优化算法  

Space and time optimized algorithm of n-Gram/2L index structure

作　　者：刘凤晨[1] 刘庆文[2] 胡玥[2] 黄河[1] 

机构地区：[1]北京航空航天大学软件学院,北京100083 [2]北京科技大学计算机科学系,北京100083

出　　处：《计算机工程与应用》2008年第5期180-183,共4页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863)(the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z140)

摘　　要：对分词检索算法n-Gram/2L的索引结构作了改进,在第二级倒排表中加入对文章标识的索引,提出一种基于Zigzag的分词检索算法n-Gram/2LZ(n-Gram/2LonZigzagjoin)。在对数据量较大的文章进行检索和索引时,该算法在保留原有算法特性的基础上进一步减少了索引冗余,降低了索引的存储量,同时对查询算法的优化降低了查询时的系统开销,并且减少索引中记录访问次数,提高了查询效率。This paper presents an improved algorithm of n-Gram/2L index for text retrieval by adding document identifier index into the secondary level inverted index,and proposes a retrieval algorithm：n-Gram/2LZ （n-Gram/2L on Zigzag join） based on Zigzag join.This algorithm retains the advantage of former n-Gram/2L algorithm and reduces redundancy and storage of the document index,while retrieving and indexing large data.And the optimization of the query algorithm decreases the system overhead when processing query as well as enhances query efficiency by reducing reading the same record repeatedly.

关 键 词：算法 索引 N-GRAM 倒排表 

分 类 号：TP391.3[自动化与计算机技术—计算机应用技术]