Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Nicole Schweikardt
This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-called \emph{mp2s-automata}. Two algorithms for solving the set disjointness problem with these automata are presented. The main technical contribution of this paper is the proof of a lower bound on the size of memory and the number of heads that are required for solving the set disjointness problem with...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.