Parallel streaming frequency-based aggregates
We present efficient parallel streaming algorithms for fundamental frequency-based aggregates in both the sliding window and the infinite window settings. In the sliding window setting, we give a parallel algorithm for maintaining a space-bounded block counter (SBBC). Using SBBC, we derive algorithm...
Saved in:
Main Authors: | Kanat Tangwongsan, Srikanta Tirthapura, Kun Lung Wu |
---|---|
其他作者: | Mahidol University |
格式: | Conference or Workshop Item |
出版: |
2018
|
主題: | |
在線閱讀: | https://repository.li.mahidol.ac.th/handle/123456789/33760 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Mahidol University |
相似書籍
-
Parallel Streaming Random Sampling
由: Kanat Tangwongsan, et al.
出版: (2020) -
Work-efficient parallel union-find
由: Natcha Simsiri, et al.
出版: (2019) -
Work-efficient parallel union-find with applications to incremental graph connectivity
由: Natcha Simsiri, et al.
出版: (2018) -
Fast Streaming k-Means Clustering with Coreset Caching
由: Yu Zhang, et al.
出版: (2020) -
General incremental sliding-window aggregation
由: Kanat Tangwongsan, et al.
出版: (2018)