Efficient Window Processing over Disordered Data Streams

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• （社）電子情報通信学会の論文
• 2010-03-01

著者

• Kim Hyeon-gyu

  School Of Electrical Engineering And Computer Science The Division Of Computer Science

• KANG Woo-Lam

  School of Electrical Engineering and Computer Science, the Division of Computer Science

• KIM Myoung-Ho

  School of Electrical Engineering and Computer Science, the Division of Computer Science

• Kang Woo-lam

  School Of Electrical Engineering And Computer Science The Division Of Computer Science

• Kim Myoung-ho

  School Of Electrical Engineering And Computer Science The Division Of Computer Science

関連論文

• Efficient Predicate Matching over Continuous Data Streams
• AMJoin : An Advanced Join Algorithm for Multiple Data Streams Using a Bit-Vector Hash Table
• Efficient Window Processing over Disordered Data Streams

スポンサーリンク