Revision as of 11:14, 10 June 2024 edit 89.239.48.118 (talk) →‎top: Fyi Tags: Reverted extraneous markup Mobile edit Mobile app edit Android app edit ← Previous edit		Latest revision as of 12:21, 10 June 2024 edit undo Uhai (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 25,344 edits m Reverted edit by 89.239.48.118 (talk) to last version by Uhai Tag: Rollback
Line 1: {{Short description\|Class of algorithms operating on data streams}} #In ~~ming~~[[computer science]], '''streaming algorithms''' are algorithms for processing [[data stream]]s in which the input is presented as a [[sequence]] of items and can be examined in only a few passes, typically [[one-pass algorithm\|just one]]. These algorithms are designed to operate with limited memory, generally [[L (complexity)\|logarithmic]] in the size of the stream and/or in the maximum value in the stream, and may also have limited processing time per item.▼ ~~In [[computer science]], '''strea~~ ▲# ming algorithms''' are algorithms for processing [[data stream]]s in which the input is presented as a [[sequence]] of items and can be examined in only a few passes, typically [[one-pass algorithm\|just one]]. These algorithms are designed to operate with limited memory, generally [[L (complexity)\|logarithmic]] in the size of the stream and/or in the maximum value in the stream, and may also have limited processing time per item. As a result of these constraints, streaming algorithms often produce approximate answers based on a summary or "sketch" of the data stream. {{TOC ~~<ref></ref>~~limit\|3}} ==History==

Streaming algorithm: Difference between revisions