In-order sliding-window aggregation in worst-case constant time
- 3 June 2021
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 30 (6) , 933-957
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- General incremental sliding-window aggregationProceedings of the VLDB Endowment, 2015
- SummingbirdProceedings of the VLDB Endowment, 2014
- M4Proceedings of the VLDB Endowment, 2014
- MillWheelProceedings of the VLDB Endowment, 2013
- Generic windowing support for extensible stream processing systemsSoftware: Practice and Experience, 2013
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- No pane, no gainACM SIGMOD Record, 2005
- Resource Sharing in Continuous Sliding-Window Aggregates2004
- Simple and efficient purely functional queues and dequesJournal of Functional Programming, 1995
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970