Adaptive selection of tuples over data streams for efficient load shedding

Joong Hyuk Chang, Nam Hun Park, Won Suk Lee

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In recent years, data stream processing algorithms have been actively proposed. In terms of computing performance, they mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, if the number of data elements in a time slot is greater than the number of those that can be processed for the time slot, some of them cannot be processed in real time even though the processing time per data element is minimized. In this paper, a selection method of frequent tuples over a data stream for efficient load shedding is proposed. Furthermore, considering the change of the data stream, a threshold for the tuples to be selected is adaptively controlled by a prediction mechanism for the frequency of a tuple. Through this mechanism, the number of selected tuples is maximized within the capacity of the main-processing operation.

Original languageEnglish
Pages (from-to)277-287
Number of pages11
JournalComputer Systems Science and Engineering
Volume23
Issue number4
Publication statusPublished - 2008 Jul 1

Fingerprint

Data Streams
Processing
Stream Processing
Data storage equipment
Restriction
Computing
Prediction

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{848af6b4301b47d79658e2f65eaac408,
title = "Adaptive selection of tuples over data streams for efficient load shedding",
abstract = "In recent years, data stream processing algorithms have been actively proposed. In terms of computing performance, they mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, if the number of data elements in a time slot is greater than the number of those that can be processed for the time slot, some of them cannot be processed in real time even though the processing time per data element is minimized. In this paper, a selection method of frequent tuples over a data stream for efficient load shedding is proposed. Furthermore, considering the change of the data stream, a threshold for the tuples to be selected is adaptively controlled by a prediction mechanism for the frequency of a tuple. Through this mechanism, the number of selected tuples is maximized within the capacity of the main-processing operation.",
author = "Chang, {Joong Hyuk} and Park, {Nam Hun} and Lee, {Won Suk}",
year = "2008",
month = "7",
day = "1",
language = "English",
volume = "23",
pages = "277--287",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",
number = "4",

}

Adaptive selection of tuples over data streams for efficient load shedding. / Chang, Joong Hyuk; Park, Nam Hun; Lee, Won Suk.

In: Computer Systems Science and Engineering, Vol. 23, No. 4, 01.07.2008, p. 277-287.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive selection of tuples over data streams for efficient load shedding

AU - Chang, Joong Hyuk

AU - Park, Nam Hun

AU - Lee, Won Suk

PY - 2008/7/1

Y1 - 2008/7/1

N2 - In recent years, data stream processing algorithms have been actively proposed. In terms of computing performance, they mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, if the number of data elements in a time slot is greater than the number of those that can be processed for the time slot, some of them cannot be processed in real time even though the processing time per data element is minimized. In this paper, a selection method of frequent tuples over a data stream for efficient load shedding is proposed. Furthermore, considering the change of the data stream, a threshold for the tuples to be selected is adaptively controlled by a prediction mechanism for the frequency of a tuple. Through this mechanism, the number of selected tuples is maximized within the capacity of the main-processing operation.

AB - In recent years, data stream processing algorithms have been actively proposed. In terms of computing performance, they mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, if the number of data elements in a time slot is greater than the number of those that can be processed for the time slot, some of them cannot be processed in real time even though the processing time per data element is minimized. In this paper, a selection method of frequent tuples over a data stream for efficient load shedding is proposed. Furthermore, considering the change of the data stream, a threshold for the tuples to be selected is adaptively controlled by a prediction mechanism for the frequency of a tuple. Through this mechanism, the number of selected tuples is maximized within the capacity of the main-processing operation.

UR - http://www.scopus.com/inward/record.url?scp=49549108482&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49549108482&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:49549108482

VL - 23

SP - 277

EP - 287

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 4

ER -