基于素数序列的Java哈希表性能优化  

Prime number sequence based performance improvement in Java Hashtable

作　　者：廖名学[1] 范植华[1] 

机构地区：[1]中国科学院软件研究所,北京100080

出　　处：《计算机工程与应用》2008年第3期108-109,142,共3页Computer Engineering and Applications

摘　　要：分析了Java哈希表的实现特点并给出了导致其性能恶化的一种数据模式。针对这种数据模式的特点,提出了基于素数序列的哈希表优化方法,从而几乎完全避免了该模式下哈希表的性能恶化。实验与理论结果表明:对提出的模式数据,优化方法产生的Hash碰撞比JDK中的方法下降接近100%,而且对随机数据下的Java哈希表性能也有改善。The method of implementing Java Hashtable is analyzed and a model of data that can seriously worsen the performance of the Hashtable is given.A method based on prime number sequence is presented to nearly completely avoid this performance deterioration under such model.Both experiments and theory proof show that the new method not only reduces the number of hash conflicts by nearly 100% than the old one in JDK for presented data model but also can improve performance of Java Hashtable for ordinary data.

关 键 词：JAVA 哈希表 素数 

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