The Community for Technology Leaders
2012 IEEE Fifth International Conference on Cloud Computing (2012)
Honolulu, HI, USA USA
June 24, 2012 to June 29, 2012
ISSN: 2159-6182
ISBN: 978-1-4673-2892-0
pp: 1002-1003
Data process in Cloud or IoT (Internet of Things) sometimes implies continuous real-time queries as data streams. In order to acquire extreme value of data stream over time-based sliding window, traditional approaches computed the exact solution through vast space especially under ultra circumstances like high-rate or high-concurrency. In this paper, we design space-bounded synopsis data structure and extreme aggregation algorithm to get approximate solution by finite extreme candidates over time sliding window, whose validity can be theoretically guaranteed. Comprehensive experiments over synthetic and real data set are designed to analyze the tradeoff between accuracy and overhead, which also illustrate the efficiency.
Reservoirs, Accuracy, Complexity theory, Algorithm design and analysis, Conferences, Cloud computing, Educational institutions, sampling, extreme aggregation, synopsis data structure

W. Ding, Y. Han, J. Wang and Z. Zhao, "Space Reduction for Extreme Aggregation of Data Stream over Time-Based Sliding Window," 2012 IEEE Fifth International Conference on Cloud Computing(CLOUD), Honolulu, HI, USA USA, 2012, pp. 1002-1003.
94 ms
(Ver 3.3 (11022016))