Skip to content

byronknoll/space-saving

master
Switch branches/tags

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

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
 
 
 
 
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

No packages published