In computer science, streaming algorithms are algorithms forprocessing data streams in which the input is presented as a sequence ofitems and can be examined in only a few passes (typically just one). Thesealgorithms have limited memory available to them (much less than the inputsize) 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.