Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Research Fast-AGMS #11

Closed
1 task done
beepy0 opened this issue Apr 13, 2019 · 0 comments
Closed
1 task done

Research Fast-AGMS #11

beepy0 opened this issue Apr 13, 2019 · 0 comments
Assignees
@beepy0
Milestone
Research

Comments

@beepy0
Copy link
Owner

beepy0 commented Apr 13, 2019 •
edited
Loading

Put here all the related information for this algorithm. Papers, experiments, videos, etc.

Papers

  • Sketching streams through the net: distributed approximate query tracking

Random Variables

  • EH3 for update (Pseudo-Random Number Generation for Sketch-Based Estimations)
  • Source code provides CW2 for the hash buckets (rows in count-min sketch), which is also 3-wise independent. But I could also implement H3 (Efficient Hardware Hashing Functions for High Performance Computers)
@beepy0 beepy0 added this to the Research milestone Apr 13, 2019
@beepy0 beepy0 self-assigned this Apr 13, 2019
@beepy0 beepy0 mentioned this issue Apr 13, 2019
Closed
8 tasks
@beepy0 beepy0 closed this as completed May 9, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@beepy0 beepy0

Labels
None yet
Projects
None yet
Milestone
Research
Development

No branches or pull requests
1 participant
@beepy0