提高自组织线性表查找性能的新方法  

A New Method for Improving Search Performance of Self-organized Linear Lists

作　　者：周蓓[1] 邹永林[1] 

机构地区：[1]常熟理工学院,江苏常熟215500

出　　处：《计算机与现代化》2013年第11期43-48,共6页Computer and Modernization

摘　　要：自组织线性表在非等概率查找中具有较好的效率。本文在原有3种基本构造策略的基础上,提出一种新方法———移至中位策略。该策略优化自组织线性表中记录的调整方式,减少了累计记录比较次数,从而提高了查找响应速度。在实验测试中,提出平稳的查找过程和非平稳的查找过程的概念,并分别设计相应的测试用例。实验结果表明,移至中位策略的综合性能最好。Self-organized linear lists are of a better efficiency in non-equal probability search. This paper puts forward a new method of moving to middle, based on three basic strategies. This method optimizes the adjustment method of recording in self-organized linear lists, reduces the comparison times of cumulative record when conflicts occur so as to shorten the reaction of searching. In experimental tests, we proposed a concept on stationarity and non-stationarity of search process, and designed the corresponding test cases. The experiments show that the comprehensive properties of the new method are best.

关 键 词：自组织线性表 计数策略 移至前端策略 转置策略 移至中位策略 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]