井下人员定位系统读卡器存储算法分析与测试

Analysis and Test of Storage Algorithm of Card Reader of Personnel Positioning System

  • 摘要: 从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。

     

    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.

     

/

返回文章
返回