工矿自动化2012，Vol.38Issue(8)：79-82,4.
井下人员定位系统读卡器存储算法分析与测试
Analysis and Test of Storage Algorithm of Card Reader of Personnel Positioning System
张峰 1徐钊 1张凯婷1
作者信息
- 1. 中国矿业大学信电学院,江苏徐州 221008
- 折叠
摘要
Abstract
The paper analyzed three storage algorithms of chain storage algorithm, hash table storage algorithm and hash binary tree storage algorithm which are applicable to the card reader of personnel positioning system in term of search time and storage capacity. It gave usage efficiency and application condition of the three kinds of storage algorithms respectively. The test results showed that the search time of the chain storage algorithm grows in linear, the hash table storage algorithm is significantly better than the chain storage algorithm: if the tested data is increased, advantage of the hash table storage algorithm will be more apparent. When the data is bigger, the hash search binary tree storage algorithm is superior than the hash table storage algorithm, and when number reaches 8 000 people above required by standard of industry, choosing the hash search binary tree storage algorithm is more reasonable.关键词
人员定位/读卡器/链式存储算法/哈希表存储算法/哈希搜索二叉树存储算法Key words
personnel positioning system, card reader, chain storage algorithm, hash table storage algorithm, hash search binary tree storage algorithm
分类
矿业与冶金引用本文复制引用
张峰,徐钊,张凯婷..井下人员定位系统读卡器存储算法分析与测试[J].工矿自动化,2012,38(8):79-82,4.
