Greedily computing associative aggregations on sliding windows

DOI10.1016/J.IPL.2014.09.009zbMATH Open1302.68335OpenAlexW2144580301MaRDI QIDQ477620FDOQ477620

Authors: Felix Klaedtke, Eugen Zălinescu, David Basin 

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.009

Recommendations

• Efficient Summing over Sliding Windows
• Distributed streams algorithms for sliding windows
• Maintaining Stream Statistics over Sliding Windows
• New algorithms for distributed sliding windows
• scientific article; zbMATH DE number 2119721

zbMATH Keywords

online algorithmsoptimalitycomplexitysliding windowassociative aggregation operator

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Cites Work

• Maintaining Stream Statistics over Sliding Windows
• Title not available (Why is that?)

Cited In (4)

• A formally verified, optimized monitor for metric first-order dynamic logic
• CASOP: A fast algorithm for computing the \(n\)-ary composition of a binary associative operator
• Efficient Summing over Sliding Windows
• Adaptive online first-order monitoring

Uses Software

• OCaml

This page was built for publication: Greedily computing associative aggregations on sliding windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477620)