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 |
---|---|
Other Authors: | Mahidol University |
Format: | Conference or Workshop Item |
Published: |
2018
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/33760 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Parallel Streaming Random Sampling
by: Kanat Tangwongsan, et al.
Published: (2020) -
Work-efficient parallel union-find
by: Natcha Simsiri, et al.
Published: (2019) -
Work-efficient parallel union-find with applications to incremental graph connectivity
by: Natcha Simsiri, et al.
Published: (2018) -
Fast Streaming k-Means Clustering with Coreset Caching
by: Yu Zhang, et al.
Published: (2020) -
General incremental sliding-window aggregation
by: Kanat Tangwongsan, et al.
Published: (2018)