The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini memfokuskan pada operator penggabungan yang digunakan untuk pemprosesan pertanyaan berterusan dengan fungsi temporal dan predikat ke atas aliran data bertingkap. Penggabungjalinan ialah operasi utama yang membolehkan penilaian predikat selang dan fungsi pada tupel temporal. Menggunakan operasi ini untuk pemprosesan pertanyaan sementara pada strim bertingkap membawa cabaran untuk menggabungkan tupel dalam takat tetingkap setiap kali tetingkap meluncur ke atas aliran data. Penyatuan ini menjadi lebih melibatkan apabila beberapa tupel tiba dalam keadaan tidak teratur. Makalah ini membezakan antara penggabungan bersemangat dan penggabungan malas, dua skema penggabungan yang diketahui. Yang pertama menyatukan tupel semasa kemas kini tahap tetingkap dan yang terakhir melakukannya semasa imbasan tahap tetingkap. Dengan kedua-dua skema ini, kertas kerja pertama kali membentangkan algoritma untuk mengemas kini tahap tetingkap untuk kedua-dua tetingkap berasaskan tuple dan berasaskan masa. Kemudian, masalah memilih secara optimum antara penggabungan bersemangat dan malas untuk pertanyaan serentak dirumuskan sebagai masalah pengaturcaraan integer 0-1. Melalui kajian prestasi yang meluas, kedua-dua skim tersebut dibandingkan dan pemilihan optimum ditunjukkan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Mohammed AL-KATEB, Sasi Sekhar KUNTA, Byung Suk LEE, "Temporal Coalescing on Window Extents over Data Streams" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 3, pp. 489-503, March 2011, doi: 10.1587/transinf.E94.D.489.
Abstract: This paper focuses on the coalescing operator applied to the processing of continuous queries with temporal functions and predicates over windowed data streams. Coalescing is a key operation enabling the evaluation of interval predicates and functions on temporal tuples. Applying this operation for temporal query processing on windowed streams brings the challenge of coalescing tuples in a window extent each time the window slides over the data stream. This coalescing becomes even more involving when some tuples arrive out of order. This paper distinguishes between eager coalescing and lazy coalescing, the two known coalescing schemes. The former coalesces tuples during window extent update and the latter does it during window extent scan. With these two schemes, the paper first presents algorithms for updating a window extent for both tuple-based and time-based windows. Then, the problem of optimally selecting between eager and lazy coalescing for concurrent queries is formulated as a 0-1 integer programming problem. Through extensive performance study, the two schemes are compared and the optimal selection is demonstrated.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.489/_p
Salinan
@ARTICLE{e94-d_3_489,
author={Mohammed AL-KATEB, Sasi Sekhar KUNTA, Byung Suk LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Temporal Coalescing on Window Extents over Data Streams},
year={2011},
volume={E94-D},
number={3},
pages={489-503},
abstract={This paper focuses on the coalescing operator applied to the processing of continuous queries with temporal functions and predicates over windowed data streams. Coalescing is a key operation enabling the evaluation of interval predicates and functions on temporal tuples. Applying this operation for temporal query processing on windowed streams brings the challenge of coalescing tuples in a window extent each time the window slides over the data stream. This coalescing becomes even more involving when some tuples arrive out of order. This paper distinguishes between eager coalescing and lazy coalescing, the two known coalescing schemes. The former coalesces tuples during window extent update and the latter does it during window extent scan. With these two schemes, the paper first presents algorithms for updating a window extent for both tuple-based and time-based windows. Then, the problem of optimally selecting between eager and lazy coalescing for concurrent queries is formulated as a 0-1 integer programming problem. Through extensive performance study, the two schemes are compared and the optimal selection is demonstrated.},
keywords={},
doi={10.1587/transinf.E94.D.489},
ISSN={1745-1361},
month={March},}
Salinan
TY - JOUR
TI - Temporal Coalescing on Window Extents over Data Streams
T2 - IEICE TRANSACTIONS on Information
SP - 489
EP - 503
AU - Mohammed AL-KATEB
AU - Sasi Sekhar KUNTA
AU - Byung Suk LEE
PY - 2011
DO - 10.1587/transinf.E94.D.489
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2011
AB - This paper focuses on the coalescing operator applied to the processing of continuous queries with temporal functions and predicates over windowed data streams. Coalescing is a key operation enabling the evaluation of interval predicates and functions on temporal tuples. Applying this operation for temporal query processing on windowed streams brings the challenge of coalescing tuples in a window extent each time the window slides over the data stream. This coalescing becomes even more involving when some tuples arrive out of order. This paper distinguishes between eager coalescing and lazy coalescing, the two known coalescing schemes. The former coalesces tuples during window extent update and the latter does it during window extent scan. With these two schemes, the paper first presents algorithms for updating a window extent for both tuple-based and time-based windows. Then, the problem of optimally selecting between eager and lazy coalescing for concurrent queries is formulated as a 0-1 integer programming problem. Through extensive performance study, the two schemes are compared and the optimal selection is demonstrated.
ER -