I/O-efficient algorithms and environments (1996)

by D E Vengroff, J S Vitter
Venue:Computing Surveys
Add To MetaCart
Results 1 - 1 of 1

Computing on Data Streams

by Monika Rauch Henzinger, Prabhakar Raghavan, Sridar Rajagopalan , 1998
"... In this paper we study the space requirement of algorithms that make only one (or a small number of) pass(es) over the input data. We study such algorithms under a model of data streams that we introduce here. We give a number of upper and lower bounds for problems stemming from queryprocessing, ..."
Abstract - Cited by 141 (3 self) - Add to MetaCart
In this paper we study the space requirement of algorithms that make only one (or a small number of) pass(es) over the input data. We study such algorithms under a model of data streams that we introduce here. We give a number of upper and lower bounds for problems stemming from queryprocessing, invoking in the process tools from the area of communication complexity.