This is a C++ implementation of the "space-saving" algorithm.
byronknoll/space-saving
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
master
Could not load branches
Nothing to show
Could not load tags
Nothing to show
{{ refName }}
default
Name already in use
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?
Code
-
Clone
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more about the CLI.
- Open with GitHub Desktop
- Download ZIP
Sign In Required
Please sign in to use Codespaces.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio Code
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
space-saving Made by Byron Knoll in 2013 http://code.google.com/p/space-saving/ 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. To compile: make Run without parameters to get help: ./space-saving Example execution: ./space-saving file.txt 10 100000 100
About
This is a C++ implementation of the "space-saving" algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published