Efficient Window Processing over Disordered Data Streams

Hyeon-Gyu KIM  Woo-Lam KANG  Myoung-Ho KIM  

IEICE TRANSACTIONS on Information and Systems   Vol.E93-D    No.3    pp.635-638
Publication Date: 2010/03/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E93.D.635
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Database
data streams,  window processing,  disorder control,  

Full Text: PDF(279.3KB)>>
Buy this Article

Bursty and out-of-order tuple arrivals complicate the process of determining contents and boundaries of sliding windows. To process windows over such streams efficiently, we need to address two issues regarding fast tuple insertion and disorder control. In this paper, we focus on these issues to process sliding windows efficiently over disordered data streams.

open access publishing via