when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-18575
URL:

### Lower Bounds for Multi-Pass Processing of Multiple Data Streams

 pdf-format:

### 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 \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 mp2s-automata.

### BibTeX - Entry

@InProceedings{schweikardt:LIPIcs:2009:1857,
author =	{Nicole Schweikardt},
title =	{{Lower Bounds for Multi-Pass Processing of Multiple Data Streams}},
booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
pages =	{51--62},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-09-5},
ISSN =	{1868-8969},
year =	{2009},
volume =	{3},
editor =	{Susanne Albers and Jean-Yves Marion},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},