This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2012 IEEE Fifth International Conference on Cloud Computing
Space Reduction for Extreme Aggregation of Data Stream over Time-Based Sliding Window
Honolulu, HI, USA USA
June 24-June 29
ISBN: 978-1-4673-2892-0
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.
Index Terms:
Reservoirs,Accuracy,Complexity theory,Algorithm design and analysis,Conferences,Cloud computing,Educational institutions,sampling,extreme aggregation,synopsis data structure
Citation:
Weilong Ding, Yanbo Han, Jing Wang, Zhuofeng Zhao, "Space Reduction for Extreme Aggregation of Data Stream over Time-Based Sliding Window," cloud, pp.1002-1003, 2012 IEEE Fifth International Conference on Cloud Computing, 2012
Usage of this product signifies your acceptance of the Terms of Use.