License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1857
URN: urn:nbn:de:0030-drops-18575
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1857/

Schweikardt, Nicole

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

pdf-format:
Dokument 1.pdf (107 KB)


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},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1857},
  URN =		{urn:nbn:de:0030-drops-18575},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1857},
  annote =	{Keywords: Data streams, Lower bounds, Machine models, Automata, The set disjointness problem}
}

Keywords: Data streams, Lower bounds, Machine models, Automata, The set disjointness problem
Seminar: 26th International Symposium on Theoretical Aspects of Computer Science
Issue date: 2009
Date of publication: 19.02.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI