|
|||||
|
|
Greedily computing associative aggregations on sliding windows |
|
| Authors: | David Basin Felix Klaedtke Eugen Z?linescu |
| Affiliation: | 1. Institute of Information Security, ETH Zurich, Switzerland;2. NEC Europe Ltd., Heidelberg, Germany |
| Abstract: | We present an algorithm for combining the elements of subsequences of a sequence with an associative operator. The subsequences are given by a sliding window of varying size. Our algorithm is greedy and computes the result with the minimal number of operator applications. |
| Keywords: | Sliding window Associative aggregation operator On-line algorithms Complexity Optimality |
| 本文献已被 ScienceDirect 等数据库收录！ | |
