Paper Info
Title
Adaptive Disorder Control in Continuous Data Streams
Abstract
A disorder control is the key factor regarding accuracy and latency of query results when processing sliding window aggregates over continuous data streams. Many stream systems maintain buffers or leverage punctuations for the control. However, current systems suffer from the lack of adaptivity in the measure for estimating buffer sizes or punctuations, which may lead to inaccurate or delayed query results. To address this problem, we propose a probabilistic approach to using an adaptive measure derived from the distributions of tuple generation intervals and network latencies. In our approach, the measure estimates buffer sizes or punctuations according to a drop ratio, which denotes a percentage of tuple drops permissible in run-time processing. The drop ratio can be defined declaratively in a query specification and it provides a way for users to control the tuple drops as their intention. The experimental results show that our adaptive measure estimates more appropriate buffer sizes than ad hoc measures, which means that the proposed measure provides a lower latency, while retaining accuracy by satisfying the given drop ratio.
Year
DOI
Venue
2006
10.1109/CIT.2006.33
CIT
Keywords
Field
DocType
adaptive measure,tuple drop,query result,proposed measure,drop ratio,appropriate buffer size,buffer size,query specification,disorder control,delayed query result,continuous data streams,adaptive disorder control,sliding window,adaptive control,out of order,satisfiability,control systems
Data stream mining,Sliding window protocol,Computer science,Tuple,Latency (engineering),Computer network,Real-time computing,Adaptive control,Probabilistic logic,Control system,Out-of-order execution,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2687-X
0
0.34
References 
Authors
9
3
Name
Order
Citations
PageRank
Hyeon Gyu Kim1145.03
Cheolgi Kim27513.38
Myoung Ho Kim31040273.40