QPOPSS: Query and Parallelism Optimized Space-Saving for finding frequent stream elements

• Published in: Journal of parallel and distributed computing Vol. 204; p. 105134
• Main Authors: Jarlow, Victor, Stylianopoulos, Charalampos, Papatriantafilou, Marina
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.10.2025
• Subjects: Computer and Information Sciences; Data- och informationsvetenskap (Datateknik)

The frequent elements problem, a key component in demanding stream-data analytics, involves selecting elements whose occurrence exceeds a user-specified threshold. Fast, memory-efficient ϵ-approximate synopsis algorithms select all frequent elements but may overestimate them depending on ϵ (user-def...