Dimension reduction comparison method for two big integers in big data analysis

Abstract

The invention discloses a dimension reduction comparison method for two big integers in big data analysis. In the application of big data, the comparison of the two big integers is a basic operation with very high use frequency, and the operation efficiency directly influences the implementation efficiency of big data application. In order to efficiently compare the two large integers, the characteristic values of the two large integers are extracted firstly, and then the comparison result of the two large integers is obtained by comparing the characteristic values of the large integers. If the large integer is a number with n bit length, the characteristic value of the large integer provided by the invention is a number with bit length. Therefore, according to the method, two n-bit long numbers are compared and converted into the n-bit long numbers, so that the solving efficiency is improved, and the problem of comparison of two large integers is efficiently solved.

Description

technical field [0001] The invention belongs to the technical field of big data analysis, and relates to a dimensionality reduction comparison method of two large integers in big data analysis. Background technique [0002] The size of the computer memory is determined by the number of bits of the address bus, if the number of bits of the address bus is 32, then the size of the memory is 2 32 = 4GB. To use a computer to solve the problem, it is necessary to transfer the processed data and the corresponding program into the memory before the program can run and process the data. In a big data application environment, the binary length of the data to be processed is far greater than the number of bits of the address bus. In other words, the memory cannot store the data to be processed. In this case, how to achieve the comparison of large integers? The current technology is generally based on the idea of ​​"divide and conquer", which divides large integers and then compares ...

AI Technical Summary

Problems solved by technology

In a big data application environment, the binary length of the data to be processed is far greater than the number of bits in the address bus. In other words, the memory cannot store the data to be processed

In this case, how to achieve the comparison of large integers? The current technology is generally based on the idea of ​​"divide and conquer", which divides large integers and then compares large integers through iteration or recursion, which has low storage and calculation efficiency.

Assume comparing two 9999 ,2 10000 -1] two large integers in the range, each of which is of size 2 20 Then each integer will be divided into 500 blocks, 500 iterations are required for comparison, and the storage space required for each iteration is (2×2 20 ) / 8=2 18 B, its storage efficiency and calculation efficiency are not high

Images