Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Simple item page
dc.creatorSchweikardt, Nicole
dc.date2009-02-10
dc.date.accessioned2026-07-07T12:39:50Z
dc.date.available2026-07-07T12:39:50Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/0902.1605
dc.identifierhttp://arxiv.org/abs/0902.1605
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 51-62
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219259
dc.subjectData Structures and Algorithms
dc.titleLower Bounds for Multi-Pass Processing of Multiple Data Streams
dc.typetext

Files

Collections

arXiv