Summary
Keywords
Full Transcript
2. Flajolet Martin Algorithm Example | FM Solved Example | Flajolet Martin Solved Example | Big Data Analytics by Vidya Mahesh Huddar Suppose the stream is S={"1, 3, 2, 1, 2, 3, 4, 3, 1, 2, 3, 1"} Let hash function be ℎ(x)=6𝑥+1 mod 5 Show how the Flajolet–Martin algorithm will estimate the number of distinct elements in this stream. Flajolet Martin Solved Example 1: https://youtu.be/_-zxFg7JNak Flajolet Martin Solved Example 2: https://youtu.be/daWtzs71AAA FM algorithm estimates the number of distinct elements using the following steps: Hash each element Convert hash value to binary Count number of trailing zeros in binary representation and store in R Take maximum R Estimate distinct count as: Estimated distinct elements=𝟐^(𝑹_𝐦𝐚𝐱 ) ******************************** Follow Us on: 1. Blog / Website: https://www.vtupulse.com/ 2. Download Final Year Project Source Code: https://vtupulse.com/download-final-year-projects/ 3. Like Facebook Page: https://www.facebook.com/VTUPulse 4. Follow us on Instagram: https://www.instagram.com/vtupulse/ 5. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates
