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

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.