Greedily computing associative aggregations on sliding windows

DOI10.1016/J.IPL.2014.09.009MaRDI QIDQ477620zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

associative aggregation operatorcomplexityonline algorithmsoptimalitysliding window

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 5182608 (Why is no real title available?)
• Maintaining Stream Statistics over Sliding Windows

Cited in

(5)

• A formally verified, optimized monitor for metric first-order dynamic logic
• Adaptive online first-order monitoring
• Efficient Summing over Sliding Windows
• Formalization of an Algorithm for Greedily Computing Associative Aggregations on Sliding Windows
• CASOP: A fast algorithm for computing the n-ary composition of a binary associative operator

Describes a project that uses

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)