Lower Bounds for Multi-Pass Processing of Multiple Data Streams

ABSTRACT. 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 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 mp2s-automata.

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Nicole Schweikardt
• Keywords: Data Stream Processing, Main Technical Contribution, Set Disjointness Problem, STACS 2009