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). In most models, these algorithms have access to limited memory (generally logarithmic in the size of and/or the maximum value in the stream). They may also have 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.
- Bot
- enInternetArchiveBot
- Comment
- enIn 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). In most models, these algorithms have access to limited memory (generally logarithmic in the size of and/or the maximum value in the stream). They may also have 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.
- Date
- enJune 2018
- FixAttempted
- enno
- Has abstract
- enIn 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). In most models, these algorithms have access to limited memory (generally logarithmic in the size of and/or the maximum value in the stream). They may also have 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.
- Hypernym
- Algorithms
- Is primary topic of
- Streaming algorithm
- Label
- enStreaming algorithm
- Link from a Wikipage to an external page
- infolab.usc.edu/csci599/Fall2002/paper/DML2_streams-issues.pdf
- www.vldb.org/conf/2001/P079.pdf
- www.cc.gatech.edu/%7Ejx/reprints/talks/sigm07_tutorial.pdf
- Link from a Wikipage to another Wikipage
- Adjacency list
- Adjacency matrix
- Bloom filter
- Boyer–Moore majority vote algorithm
- Category:Streaming algorithms
- Communication complexity
- Computer network
- Computer science
- Count-Min sketch
- Daniel Kane (mathematician)
- Data stream
- Data stream clustering
- Data stream mining
- Elephant flow
- Feature hashing
- Gini coefficient
- Gödel Prize
- Jelani Nelson
- Join (SQL)
- Journal of Computer and System Sciences
- L (complexity)
- Lossy Count Algorithm
- Mario Szegedy
- Misra–Gries heavy hitters algorithm
- Misra–Gries summary
- Moving average
- Noga Alon
- One-pass algorithm
- Online algorithm
- Online algorithms
- Philippe Flajolet
- Random access
- Robert Morris (cryptographer)
- Semi-streaming algorithm
- Sequence
- Sequential algorithm
- Set (mathematics)
- Statistical classification
- Stochastic gradient descent
- Stream processing
- Yossi Matias
- SameAs
- 2dwMA
- Algorithme de fouille de flots de données
- m.05mwz95
- Q2835831
- Streaming algorithm
- Thuật toán dòng dữ liệu
- Поточный алгоритм
- الگوریتم جریان دادهها
- Subject
- Category:Streaming algorithms
- WasDerivedFrom
- Streaming algorithm?oldid=1123452648&ns=0
- WikiPageLength
- 25597
- Wikipage page ID
- 21759411
- Wikipage revision ID
- 1123452648
- WikiPageUsesTemplate
- Template:Algorithmic paradigms
- Template:Citation
- Template:Citation needed
- Template:Cite conference
- Template:Dead link
- Template:Main
- Template:Math
- Template:Mvar
- Template:Tmath
- Template:TOC limit
- Template:Unreferenced section
- Template:Var