自组织线性表的算法设计与性能分析  

Algorithms designing and performance analysing for self-organized lists

作　　者：邹永林[1] 沈健[1] 

机构地区：[1]常熟理工学院计算机学院

出　　处：《信息技术》2014年第3期149-152,共4页Information Technology

摘　　要：针对非等概率查找问题,采用自组织线性表作为查找表,探讨了有关的算法设计方法,并通过测试用例和记录访问模式的设计,对其查找性能进行深入研究和分析,得到了预期的结果。这些结果无论对于教学和工程实践应用都具有积极的意义。Due to the unequal probability search problems, the ideals and methods that throughlng the records those were searched frequently be moved to the locations nearing the beginning of the search tables, then effectively reducing the count of records comparisons and improving the efficiency of search procedure by using three reconstructing strategies such as ＂count＂, ＂move-to-front＂ and ＂transpose＂ to adjust the new status of search tables based on the concepts and basic principles of self-organized lists were investigated and surveyed in this paper. And then, the algorithms designing and searching efficiency of those methods were analysed and discussed by using four test cases and record access models. Finally, the expected results were obtained.

关 键 词：自组织线性表 静态查找 动态查找 访问模式 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]