Lower Bounds for Multi-Pass Processing of Multiple Data Streams - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Nicole Schweikardt
  • Function : Author
  • PersonId : 857925

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 wi th 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 solvin g the set disjointness problem with mp2s-automata.
Fichier principal
Vignette du fichier
Schweikardt-STACS09_new.pdf (156.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00359686 , version 1 (09-02-2009)

Identifiers

  • HAL Id : inria-00359686 , version 1
  • ARXIV : 0902.1605

Cite

Nicole Schweikardt. Lower Bounds for Multi-Pass Processing of Multiple Data Streams. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.51-62. ⟨inria-00359686⟩

Collections

STACS2009
32 View
79 Download

Altmetric

Share

Gmail Facebook X LinkedIn More