You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Made by Byron Knoll in 2013
This is a C++ implementation of the "space-saving" algorithm described in:
A. Metwally, D. Agrawal, and A. El Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams. In Proceedings of the 10th ICDT International Conference on Database Theory, pages 398–412, 2005.
This project is released in the public domain - you can use the source code however you want.
The example program (runner.cpp) finds the most frequently occurring substrings of length N in a file.
Run without parameters to get help:
./space-saving file.txt 10 100000 100
This is a C++ implementation of the "space-saving" algorithm.