Skip to content

This repository contain an implementation of the famous DGIM algorithm

Notifications You must be signed in to change notification settings

ikmOfSA/Algorithms-DGIM

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Algorithms-DGIM

This repository contain a program that uses the DGIM algorim to estimate the sum of the most recent 10,000 integers from a stream constantly. All the code are written by myself.

DGIM

DGIM(Datar-Gionis-Indyk-Motwani) is an algorithm that are famous in the big data field. Algorithm uses O(log2 N) bits to sum up the number of 1s from a window of N bits with an error of no more than 50%.

Files

  1. Run dgim_linux.c and dgim.h on linux system will generate an excutable program called dgim_linux, which will run the DGIM algorithm and print the result. However, before running it, you should provide data files.

  2. Run rand_generator_linux.c will generate the rand_generator_linux excutable program, which will produce 8 data files that feed the DGIM algorithm: 1 file contain 1,000,000 random integers range from [1, 127]; and 7 files contain 1,000,000 bit point, one for each position in the 2's complement form of the first file. These 1,000,000 number represent the data stream.

About

This repository contain an implementation of the famous DGIM algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages