Streaming Algorithm
In computer science, streaming algorithms are algorithms for processing data streams in which the input is presented as a sequence of items and can be examined in only a few passes (typically just one). These algorithms have limited memory available to them (much less than the input size) and also limited processing time per item.
These constraints may mean that an algorithm produces an approximate answer based on a summary or "sketch" of the data stream in memory.
Read more about Streaming Algorithm: History, Models, Evaluation, Applications, Lower Bounds, See Also
Famous quotes containing the word streaming:
“We are living in a demented world. And we know it. It would not come as a surprise to anyone if tomorrow the madness gave way to a frenzy which would leave our poor Europe in a state of distracted stupor, with engines still turning and flags streaming in the breeze, but with the spirit gone.”
—Johan Huizinga (1872–1945)