Table relationship automatic association method based on multiple hash functions
An automatic association and hash function technology, applied in the information field, can solve the problems of incomplete association, low data quality, time-consuming and laborious manual verification, etc., to achieve high flexibility, reduce time costs, and achieve the effect of reuse
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0022] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0023] A hash table is a data structure that maps the data to be queried to a location in the table by calculating a function about the key value to access records and speed up the lookup. This mapping function is called a hash function.
[0024] Using this specificity, firstly, a fixed-length space can be allocated in the computer memory for storing binary vectors, and then multiple hash functions are constructed, each of which maps the input value to a position, and then the binary vector The value at that position in the vector is set to change. It can be proved that using the mapping of this data structure and hash function can be used to judge whether an element exists in a certain set very quickly.
[0025] Part 1: Basic Principles and Verification Methods
[0026] The meaning of the so-called binary vector, that is, the value of each...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


