Live briefing
Everything about Streaming algorithm
Class of algorithms operating on data streams
In computer science, streaming algorithms process input data streams as a sequence of items, typically making just one pass through the data. These algorithms are designed to operate with limited memory, generally 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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Streaming algorithmA 5-minute orientation
- Skim a recent paper: Online and offline streaming feature selection methods with bat algorithm for redundancy analysisInfluential work since 2022
- Pick up a classic book: Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)The most-reprinted book on the subject
- Read the landmark paper: An efficient streaming algorithm for spectral proper orthogonal decompositionCited 86 times
- Go sideways: HyperLogLogA closely related topic
- Go sideways: Flajolet–Martin algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
An efficient streaming algorithm for spectral proper orthogonal decomposition
LBP: Robust Rate Adaptation Algorithm for SVC Video Streaming
SWEclat: a frequent itemset mining algorithm over streaming data using Spark Streaming
Performance-aware scheduling of streaming applications using genetic algorithm
EvolveCluster: an evolutionary clustering algorithm for streaming data
Multiscale algorithm for reconstructing videos from streaming compressive measurements
A fuzzy algorithm for dynamically adaptive multimedia streaming
Network Adapted Selective Frame-Dropping Algorithm for Streaming Media
🆕 Influential since 2022
Online and offline streaming feature selection methods with bat algorithm for redundancy analysis
Event detection from real-time twitter streaming data using community detection algorithm
RHDOFS: A Distributed Online Algorithm Towards Scalable Streaming Feature Selection
Smart algorithm in wireless networks for video streaming based on adaptive quantization
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors
đź“š Books worth reading
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013- 📕Incidents and freeway operationsNational Research Council (US) · 1974
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- HyperLogLog HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality…
- Flajolet–Martin algorithm The Flajolet–Martin algorithm is an algorithm for approximating the number of distinct elements in a stream with a single pass and space-consumption logarithmic…
- Retrieval Data Structure In computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection…
- K-independent hashing In computer science, a family of hash functions is said to be k-independent, k-wise independent if selecting a function at random from the family guarantees…
- Misra–Gries summary In the field of streaming algorithms, Misra–Gries summaries are used to solve the frequent elements problem in the data stream model. That is, given a…
- Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…
- MinHash In computer science and data mining, MinHash (or the min-wise independent permutations locality-sensitive hashing scheme) is a technique for quickly estimating…
- Approximate membership query filter Approximate membership query filters (hereafter, AMQ filters) comprise a group of space-efficient probabilistic data structures that support approximate…