期刊文献+

文件系统索引结构的研究 被引量:1

Research on Index Structure of File System
下载PDF
导出
摘要 在分析常用文件系统索引结构的基础上,提出了一个文件系统动态存储和索引结构,层次散列索引模型(HierarchicalHashingIndexModel,HIM)·HIM应用动态散列技术,以线性散列表(LinearHashingTable)为基本结构,并辅以专门设计的字符序列映射函数,整体上优化了HIM结构,提高了文件系统的索引性能·HIM是文件系统索引结构的抽象模型,可应用于任何文件系统的设计中· Based on analyzing the index structure of the file systems in common use, a dynamic storage/index structure of file system, is proposed, i.e. the Hierarchical Hashing Index Model(HIM). It uses dynamic hashing technique to construct a linear hashing table as together with a character mapping function designed to optimize the whole structure of HIM and improve the performance of file systems. HIM as an abstract model for the index structure of file system,can be applied to the design of any file systems.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2004年第4期318-321,共4页 Journal of Northeastern University(Natural Science)
基金 辽宁省自然科学基金资助项目.
关键词 层次散列索引模型(HIM) 动态散列技术 字符序列映射函数 抽象模型 hierarchical hashing index model dynamic hashing technique character mapping function abstract model
  • 相关文献

参考文献11

  • 1[1]Moshe B. Linux file systems[M]. New York: McGraw-Hill Osborne Media Co, 2001.266-310. 被引量:1
  • 2[2]Steve D P. UNIX filesystems: evolution, design, and implementation[M]. New York: John Wiley & Sons, 2003.166-198. 被引量:1
  • 3[3]Clifford A S. A practical introduction to data structures and algorithm analysis[M]. Englewood Cliffs: Prentice-Hall Inc, 1997.80-92. 被引量:1
  • 4[4]Litwin W. Linear hashing: a new tool for files and tables addressing[A]. International Conference on Very Large Data Bases[C]. New York: ACM Press, 1980.212-223. 被引量:1
  • 5[5]Bell J, Gupta G K. Implementing linear hashing in main memory[J]. Australian Computer Science Communications, 1992,14(1):71-91. 被引量:1
  • 6[6]Teuhola J. Effective clustering of objects stored by linear hashing[A]. Proceedings of the Fourth International Conference on Information and Knowledge Management[C]. Baltimore, 1995.274-280. 被引量:1
  • 7[7]Knuth D E. The art of computer programming (2nd edition), Volumes 3: sorting and searching[M]. Reading: Addison-Wesley Publishing Co, 1998.263-276. 被引量:1
  • 8[8]Ricardo A. Analysis of linear hashing revisited[J]. Nordic Journal of Computing, 1998,5(1):70-85. 被引量:1
  • 9[9]Dietzfelbinger M, Karlin A. Dynamic perfect hashing: upper and lower bounds[J]. SIAM Journal of Computing, 1994,23(1):738-761. 被引量:1
  • 10[10]Rackoff C, Luby M. How to construct pseudorandom permutations from pseudorandom functions[J]. SIAM Journal of Computing, 1988,17(2):373-386. 被引量:1

同被引文献13

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部