Data stream algorithm; One-pass algorithm; Streaming algorithm
A one-pass algorithm receives as input a list of data items x1, x2, x3,…. It can read these data items only once, from left to right, i.e., in increasing order of the indices i = 1, 2, 3,…. Critical parameters of a one-pass algorithm are (1) the size of the memory used by the algorithm, and (2) the processing time per data item xi. Typically, a one-pass algorithm is designed for answering one particular query against the input data. To this end, the algorithm stores and maintains a suitable data structure which, for each i, is updated when reading data item xi.
The two parameters processing time per data item and memory size are usually measured as functions depending on the size N of the input (different measures of the input sizeare considered in the literature, among them, e.g., the number of data items occurring in the input, as well as the total number of bits needed for storing the entire input)....
- 2.Henzinger M, Raghavan P, Rajagopalan S. Computing on data streams. In: External memory algorithms. DIMACS series in discrete mathematics and theoretical computer science 50. Boston: American Mathematical Society; 1999. p. 107–18.Google Scholar