Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2006.13D.6.755

Load Shedding via Predicting the Frequency of Tuple for Efficient Analsis over Data Streams  

Chang, Joong-Hyuk (연세대학교 소프트웨어응용연구소)
Abstract
In recent, data streams are generated in various application fields such as a ubiquitous computing and a sensor network, and various algorithms are actively proposed for processing data streams efficiently. They mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, in the algorithms, if data elements of a data stream are generated in a rapid rate for a time unit, some of the data elements cannot be processed in real time. Therefore, an efficient load shedding technique is required to process data streams effcientlv. For this purpose, a load shedding technique over a data stream is proposed in this paper, which is based on the predicting technique of the frequency of data element considering its current frequency. In the proposed technique, considering the change of the data stream, its threshold for tuple alive is controlled adaptively. It can help to prevent unnecessary load shedding.
Keywords
Data Stream; Load Shedding; Significant Tuple; Prediction of Frequency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Babcock, M. Datar, and R. Motwani. Load Shedding for Aggregation Queries over Data Streams. In Proceedings of the 19th International Conference on Data Engineering, pp.350-361, 2004
2 A. Arasu, S. Babu, and J. Widom. An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations. Stanford University Technical Report 2002-57, 2002
3 M. Datar, A. Gionis, P. Indyk, and R. Motawi, Maintaining Stream Statistics over Sliding Windows, In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.635-644, 2002
4 D. Lambert and J.C. Pinheiro, Mining a Stream of Transactions for Customer Patterns, In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.305-310, 2001   DOI
5 R. Avnur and J. M. Hellerstein. Eddies: Continuously Adaptive Query Processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.261-272, 2000
6 A. Das, J. Gehrke, and M. Riedewald. Approximate Join Processing over Data Streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.40-51, 2003   DOI
7 R. Motwani, J. Widom, A. Arasu, B. Babcock, S. Babu, M. Datar, G. Manku, C. Olston, J. Rosenstein, and R. Varma. Query Processing, Approximation, and Resource Management in a Data Stream Management System. In Proceedings of the 1st Biennial Conference on Innovative Data Systems Research, pp.245-256, 2003
8 J. Kang, J.F. Naughton, and S. D. Viglas. Evaluating Window Joins over Unbounded Streams. In Proceedings of the 19th International Conference on Data Engineering, pp.341-352, 2003
9 D.J. Abadi, D. Carney, U. Cetinternel, M. Cherniack, C. Convey, S. Lee, M. Stonebraker, N. Tatbul, and S.B. Zdonik. Aurora: A New Model and Architecture for Data Stream Management. VLDB Journal, Vol.12, No.2, pp.120-139, 2003   DOI
10 M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and Mining Data Streams: You Only Get One Look. In the tutorial notes of the 28th International Conference on Very Large Data Bases, 2002
11 J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In Proceedings of the ACM International Conference on Management of Data, pp.379-390, 2000
12 Y. Zhu, D. Shasha. StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time. In Proceedings of the 28th International Conference on Very Large Data Bases, pp.358-369, 2002
13 C. Cortes, K. Fisher, D. Pregibon, A. Rogers, and F. Smith. Hancock: A Language for Extracting Signatures from Data Streams. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.9-17, 2000
14 J.M. Hellerstein, W. Hong and S.R. Madden, The Sensor Spectrum: Technology, Trends, and Requirements. ACM SIGMOD Record, Vol.32, No.4, pp.22-27, 2003   DOI   ScienceOn