Create a gist now

Instantly share code, notes, and snippets.

What would you like to do?
A collection of links for streaming algorithms and data structures
  1. General Background and Overview
  1. Hyperloglog and MinHash : Implementation of a form of hyperloglog and adding capabilities of MinHash algorithm on to it which would enable to perform set intersections."While it does require extra processing power to deal with collecting all the minima, it’s possible to get satisfactory performance out of the structure for a relatively low storage or memory footprint"

  2. Streaming/Sketching Conference from AK Tech : Contains links to videos and slides from the speakers like Muthukrishnan who spoke about Count Min Sketch

  3. Q-digest

  1. t-digest : A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. Ted Dunning's variant of Q-digest that does some improvements

  2. Implementations

  1. Count-Min Sketch
  1. Surveys
  • References for Data Stream Algorithms by Graham Cormode : an exhaustive set of references with explanations
  • Data Streams - Algorithms and Applications by S. Muthukrishnan : This is an excellent monograph with surveys of all algorithms related to data streams. Also a free copy of the book is available from Muthu's web site at
  • Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches by Graham Cormode1, Minos Garofalakis, Peter J. Haas and Chris Jermaine . Describes basic principles and recent developments in approximate query processing. It focuses on four key synopses: random samples, histograms, wavelets, and sketches. It considers issues such as accuracy, space and time efficiency, optimality, practicality, range of applicability, error bounds on query answers, and incremental maintenance. It also discusses the trade-offs between the different synopsis types.
  1. Distributed Streams Algorithms for Sliding Windows by Phillip B. Gibbons and Srikanta Tirthapura

  2. Frugal Streaming

  3. A Framework for Clustering Massive-Domain Data Streams by Charu C. Aggarwal

  4. A framework for clustering evolving data streams by Charu C. Aggarwal et. al.

  5. Unsupervised Feature Selection on Data Streams by Hao Huang

  6. Presentations

  1. Courses
  1. Incremental Learning with Decision Trees for Streamed Data
  1. Clustering Data Streams
  1. Books
  • Andrew McGregor is writing a book on sketching and data streaming algorithms, parts of the draft is available here

What about having a render-friendlier format like md?
This gist is a pearl, but horizontal scrolling is a bit sad ;-)


debasishg commented Dec 31, 2013

done ..

slnovak commented Jun 12, 2014

Thank you! Found via DataTau.

blinsay commented Jun 13, 2014

AggregateKnowledge has a good set of serialization-compatible Postgres/JS/Java HLL implementations:

Thanks Debashish this is valuable!

Great summary.


Thanks !

Thanks! This is great 👍

great stuff!

Thanks (y) for this awesome stuff

If Apache Flink's "delta iterations", "off heap memory management" and "cost based optimization" qualify as "algorithms" then consider "Overview of Apache Flink: Next-Gen Big Data Analytics Framework":

Thank you.. It is really valuable for the community..

Thanks a great resource indeed

grillz commented Feb 20, 2016


Adewole commented Apr 17, 2016

Interesting post.

leerho commented May 25, 2016

You might be interested in DataSketches. A new production quality library of unique counting, quantiles, and frequent items sketches.

Exactly what I was looking for! Thanks!

OElesin commented Dec 9, 2016

Great Stuff, just found this!!

visenger commented May 3, 2017

Great! found via @ds_ldn


Link to Blog Post on q-digest seems broken. A quick google point me to
Please update it. Thanks.

really nice list, can you consider adding it to the Awesome project so that more people can benefit ;-)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment