Lower bounds for randomized read/write stream algorithms

  title={Lower bounds for randomized read/write stream algorithms},
  author={Paul Beame and T. S. Jayram and Atri Rudra},
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multiple streams. Unlike the data stream model, where the stream is read only, in this new model (introduced in [8,9]) the algorithms can also write onto streams. There is no limit on the size of the streams but the number of passes made on the streams is restricted. On the other hand, the amount of internal memory used by… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
27 Citations
5 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…