陈慧杰,李建伟

• 1:太原科技大学计算机科学与技术学院

摘要(Abstract)：

为了分析分裂条件(桶溢出和存储利用率)和数据偏斜性对线性散列、可扩展散列、改进的动态散列目录增长的影响,对三种动态散列的目录扩展算法进行了研究。实验结果表明,在数据分布均匀的情况下,采用桶溢出分裂与采用存储利用率分裂相比较,三种动态散列目录增长速度较快,溢出桶数目较少;当采用存储利用率作为分裂条件时,三种数据分布偏斜情况对线性散列与可扩展散列的目录增长的影响相同。当采用桶溢出作为分裂条件时,数据分布越靠后端,线性散列目录增长越慢,改进的动态散列目录增长越快。

关键词(KeyWords)： 动态散列;数据偏斜性;分裂条件;目录尺寸

Abstract:

Keywords:

基金项目(Foundation): 山西省自然科学基金(2012011027-3)

作者(Author): 陈慧杰,李建伟

参考文献(References)：

• [1]RAMMOHANRAO K,LIOYD JOHN W.Dynamic Hashing Schemes[J].Computer Journal,1982,25(4):475-485.
• [2]LITWIN W.Linear hashing:a new tool for file and table addressing[C]∥Proceedings of the 6th international conference on very large data bases.Canada:Montreal,1980:212-223.
• [3]FAGIN R,NIEVERGELT J.Extendible hashing-a fast access method for dynamic files[J].ACM Trans Database Syst,1979,4(3):315-344.
• [4]CHEN HUIJIE,LI JIANWEI.The Research of Embedded Database Hybrid Indexing Mechanism Based on Dynamic Hashing[C]∥Proceedings of the 2012 International Conference on Information Technology and Software Engineering.Germany:Springer Berlin Heidelberg,2013:691-697.
• [5]LI XIANG,ZHOU D,MENG X F.A New Dynamic Hash Index for Flash-Based Storage[C]∥Proceedings of the 9rd Conference on Web-Age Information Management.Washington:IEEE Computer Society,2008:93-98.
• [6]RATHI A,LU H.Performance comparison of extendible hashing and linear hashing techniques[C]∥Proceedings of the 1990ACM SIGSMALL/PC Symposium on Small Systems.New York:ACM,1991:19-26.
• [7]LARSON P.Performance analysis of a single-file version of linear hashing[J].Computer Journal,1985,28:319-326.
• [8]YANG CHUL-WOONG,LEE KI-YONG,KIM HO,et al.An Efficient Dynamic Hash Index Structure for NAND Flash Memory[J].IEICE TRANSACTIONS on Fundamentals of Electronics,Communications and Computer Sciences,2009,E92-A7,1716-1719.
• [9]YOO MIN-HEE,KIM BBO-KYEONG,LEE DONG-HO.Hybrid Hash Index for NAND Flash Memory-based Storage Systems[C]∥Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication,USA:NY,2012.