arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0902.1605cs.DS
收藏

多数据流多遍处理的下界

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Nicole Schweikardt

摘要:

本文简要介绍了数据流处理的计算模型,并介绍了一种新的多流多遍处理模型,即mp 2s-自动机。给出了用这类自动机求解集合不相交性问题的两个算法。本文的主要技术贡献是证明了用mp 2s-自动机求解集合不相交性问题所需的内存大小和头数的一个下界。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑