Streaming algorithms must process a large quantity of small updates quickly to allow queries about the input to be answered from a small summary. Initial work on streaming algorithms laid out theoretical results, and subsequent efforts have involved engineering these for practical use. Informed by experiments, streaming algorithms have been widely implemented and used in practice. This talk will survey this line of work, and identify some lessons learned.
@InProceedings{cormode:LIPIcs.SEA.2017.3, author = {Cormode, Graham}, title = {{Engineering Streaming Algorithms}}, booktitle = {16th International Symposium on Experimental Algorithms (SEA 2017)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-036-1}, ISSN = {1868-8969}, year = {2017}, volume = {75}, editor = {Iliopoulos, Costas S. and Pissis, Solon P. and Puglisi, Simon J. and Raman, Rajeev}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.3}, URN = {urn:nbn:de:0030-drops-76270}, doi = {10.4230/LIPIcs.SEA.2017.3}, annote = {Keywords: Data stream algorithms} }
Feedback for Dagstuhl Publishing