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


The KIPS Transactions:PartD, Vol. 13, No. 6, pp. 755-764, Oct. 2006
http://dx.doi.org/10.3745/KIPSTD.2006.13D.6.755,   PDF Download:
Keywords: data stream, load shedding, Significant Tuple, Prediction of Frequency
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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. Joong-Hyuk, "Load Shedding via Predicting the Frequency of Tuple for Efficient Analsis over Data Streams," The KIPS Transactions:PartD, vol. 13, no. 6, pp. 755-764, 2006. DOI: http://dx.doi.org/10.3745/KIPSTD.2006.13D.6.755.

[ACM Style]
Chang Joong-Hyuk. 2006. Load Shedding via Predicting the Frequency of Tuple for Efficient Analsis over Data Streams. The KIPS Transactions:PartD, 13, 6, (2006), 755-764. DOI: http://dx.doi.org/10.3745/KIPSTD.2006.13D.6.755.