Implementing Flajolet and Martin’s Algorithm in python -
The following is the code I have written to apply. I use the Jenkins hash function The code has to be used for the 32-bit hash value program sounds algorithm, but close to 20% the mark is closed. My data set has more than 200,000 unique records, while the program has approximately 160,000 unique records. Please help me understand the mistakes I have been making. The hash function has been implemented accordingly.
If you are running it in Python 2, then calculate the partition For one one may be in being changed for an integer
If this is the case, then you can try to change:.
A = float (sumIx) / self.nmap a = sumIx / self .nmap
/ Code>
Comments
Post a Comment