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:
“The mob is man voluntarily descending to the nature of the beast. Its fit hour of activity is night. Its actions are insane like its whole constitution. It persecutes a principle; it would whip a right; it would tar and feather justice, by inflicting fire and outrage upon the houses and persons of those who have these. It resembles the prank of boys, who run with fire-engines to put out the ruddy aurora streaming to the stars.”
—Ralph Waldo Emerson (1803–1882)