期刊文献+

Hash表实现原理及其算法的应用探析

下载PDF
导出
摘要 Hash表是一种重要的数据结构,广泛应用于快速查找、匹配算法,同时在信息安全、数据库设计和海量信息处理方面有着重要的作用,本文首先介绍Hash表的的实现原理,进一步从Hash算法的常见应用场景探析其在各领域的广泛作用,渐进的讨论了数据结构中散列的思想,最后总结Hash算法的应用原则,帮助从业人员能够快速理解Hash的思想,并能够理解应用。
作者 张宇航
出处 《电子技术与软件工程》 2016年第21期177-178,共2页 ELECTRONIC TECHNOLOGY & SOFTWARE ENGINEERING
  • 相关文献

参考文献8

  • 1Schneier B, Schneier B. 18. One-Way Hash Functions[M]// Applied Cryptography, Second Edition, 20th Anniversary Edition. John Wiley & Sons, Inc. 2015.
  • 2Guyeux C, Bahi J M. Topological chaos and chaotic iterations application to hash functions[J]. Ijcnn 10 Int. joint Conf. on Neural Networks Joint to Wcci 10 IEEE Worid Congress on Computational Intelligence, 2015,41(03):1-7.
  • 3Nasr R, flirschberg D S, Baldi P. Hashing algorithms and data structures for rapid searches of fingerprint vectors. [J]. Journal of Chemical Information & Modeling, 2010,50(08):1358-68.
  • 4Blackburn R A, Dryfoos R O, Fisher Sr.G A, et al. Method and system for dynamically managing hash pool data structures:US, US6748401[P].2004.
  • 5Yen I L, Leu D R, Bastani F. Hash table and sorted array: a case study of multi-entry data structures in massively parallel systems[C]// Frontiers of Massively Parallel Computation, 1990. Proceedings. Symposium on the. 1990:51-54.
  • 6叶军伟.哈希表冲突处理方法浅析[J].科技视界,2014(6):230-230. 被引量:3
  • 7龚俊,柯胜男,朱庆,张叶廷.一种集成R树、哈希表和B^*树的高效轨迹数据索引方法[J].测绘学报,2015,44(5):570-577. 被引量:19
  • 8李鹏飞,张坤龙,康超凡.基于低冲突帮助机制的快速无等待哈希表算法[J].计算机工程,2015,41(11):52-58. 被引量:4

二级参考文献26

  • 1尹章才,李霖.基于快照-增量的时空索引机制研究[J].测绘学报,2005,34(3):257-261. 被引量:27
  • 2郭晶,刘广军,郭磊,董绪荣.基于3D^+-TPR-tree的点目标全时段移动索引设计[J].测绘学报,2006,35(3):267-272. 被引量:4
  • 3张科.多次Hash快速分词算法[J].计算机工程与设计,2007,28(7):1716-1718. 被引量:22
  • 4Liu Yujie, Zhang Kunlong, Spear M. Dynamic-sized Nonblocking Hash Tables [ C ]//Proceedings of 2014 ACM Symposium on Principles of Distributed Com- puting. Paris, France : ACM Press, 2014 : 242-251.
  • 5Herlihy M. Wait-free Synchronization [ J ]. ACM Trans- actions on Programming Languages and Systems, 1991, 13(1) :124-149.
  • 6Kogan A, Petrank E. A Methodology for Creating Fast Wait-free Data Structures [ C ]//Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York, USA: ACM Press, 2012 : 141-150.
  • 7Michael M M. High Performance Dynamic Lock-free Hash Tables and List-based Sets [ C]//Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures. New York,USA :ACM Press ,2002:73-82.
  • 8Harris T L. A Pragmatic Implementation of Non-blocking Linked-lists [ C ]//Proceedings of the 15th International Conference on Distributed Computing. Berlin, Germany : Springer ,2001:300-314.
  • 9Greenwald M. Two-handed Emulation:How to Build Non- blocking Implementations of Complex Data-structures Using DCAS [ C ]//Proceedings of the 21st Annual Sym- posium on Principles of Distributed Computing. New York,USA :ACM Press ,2002:260-269.
  • 10Luchangco V, Moir M, Shavit N. Nonblocking k-compare- single-swap[ C]//Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures. New York,USA:ACM Press,2003:314-323.

共引文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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