In a growing number of information processing applications, data takes the form of continuous data streams rather than traditional stored databases. Most of these applications have sophisticated real-time constraint that needs to be met under unbounded, high-volume, time-varying data streams. We introduce deadline as a real-time constraint of continuous query over data streams. Specifically, a deadline-sensitive approach for sliding window processing is proposed, which predicts a sliding window would satisfy its deadline or not. Once deadline missing is predicted, HopDrop, a proposed load shedding strategy would be applied to lighten the system burden in advance. Furthermore, feedback control mechanism is applied to improve the adaptivity of our approach. Extensive experimental results are presented and analyzed to validate our strategies. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Wu, S., Yu, G., Yu, Y., Ou, Z., Yang, X., & Gu, Y. (2005). A deadline-sensitive approach for real-time processing of sliding windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 566–577). https://doi.org/10.1007/11563952_49
Mendeley helps you to discover research relevant for your work.