no code implementations • 26 Oct 2018 • Kanat Tangwongsan, Martin Hirzel, Scott Schneider
This paper presents the design, analysis, and implementation of FiBA, a novel sliding-window aggregation algorithm with an amortized upper bound of $O(\log d)$ time per insert or evict, where $d$ is the distance of the inserted or evicted value to the closer end of the window.
Data Structures and Algorithms Databases
