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:
“Who wants to become a writer? And why? Because it’s the answer to everything. To “Why am I here?” To uselessness. It’s the streaming reason for living. To note, to pin down, to build up, to create, to be astonished at nothing, to cherish the oddities, to let nothing go down the drain, to make something, to make a great flower out of life, even if it’s a cactus.”
—Enid Bagnold (1889–1981)