Compression method for short links code method based on Hash function
In order to meet the user's requirements for shortening URL links and query performance under massive data,and reduce the collision probability between generated short chain codes and reduce the Car-tesian product operation,a Hash function-based string compression algorithm in the massive data scenario is proposed.The algorithm meets the requirements of the same information output results of users'input at one time and different information output results of the same input at different times.It uses random factors and the library epitope information contained in the short chain code to reduce the short chain code genera-tion conflict and the Cartesian product operation caused by massive data.Experiment results show that the time-consuming performance of the improved compression algorithm is slightly slower,while the collision rate is significantly reduced,and the query performance is improved by 78％～130％,which becomes more obvious with the increase of the amount of data.
NETL
NSTL
万方数据
