Key points are not available for this paper at this time.
Various research communities have independently arrived at stream processing as a programming model for efficient and parallel computing. These communities include digital signal processing, databases, operating systems, and complex event processing. Since each community faces applications with challenging performance requirements, each of them has developed some of the same optimizations, but often with conflicting terminology and unstated assumptions. This article presents a survey of optimizations for stream processing. It is aimed both at users who need to understand and guide the system’s optimizer and at implementers who need to make engineering tradeoffs. To consolidate terminology, this article is organized as a catalog, in a style similar to catalogs of design patterns or refactorings. To make assumptions explicit and help understand tradeoffs, each optimization is presented with its safety constraints (when does it preserve correctness?) and a profitability experiment (when does it improve performance?). We hope that this survey will help future streaming system builders to stand on the shoulders of giants from not just their own community.
Building similarity graph...
Analyzing shared references across papers
Loading...
Martin Hirzel
Australian National University
Robert Soulé
Yale University
Scott Schneider
University of Michigan
ACM Computing Surveys
New York University
IBM (United States)
Bilkent University
Building similarity graph...
Analyzing shared references across papers
Loading...
Hirzel et al. (Sat,) studied this question.
synapsesocial.com/papers/6a110545eeb8b66439168634 — DOI: https://doi.org/10.1145/2528412