Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

STACS
2009
Springer

favoriteEmaildiscussreport

117views Theoretical Computer Science» more STACS 2009»

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

13 years 9 months ago

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Download hal.archives-ouvertes.fr

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.

Nicole Schweikardt

Real-time Traffic

Data Stream Processing | Main Technical Contribution | Set Disjointness Problem | STACS 2009 |

claim paper

Related Content

» Machine models and lower bounds for query processing

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Tight Lower Bounds for Query Processing on Streaming and External Memory Data

» Lower bounds for randomized readwrite stream algorithms

» On the Optimality of Holistic Algorithms for Twig Queries

» On the Value of Multiple ReadWrite Streams for Approximating Frequency Moments

» The Complexity of Querying External Memory and Streaming Data

» Processing DataStream Join Aggregates Using Skimmed Sketches

» Efficient Execution of Continuous Incoherency Bounded Queries over MultiSource Streaming D...

Post Info
More Details (n/a)

Added	27 Jul 2010
Updated	27 Jul 2010
Type	Conference
Year	2009
Where	STACS
Authors	Nicole Schweikardt

Comments (0)