AMJoin : An Advanced Join Algorithm for Multiple Data Streams Using a Bit-Vector Hash Table

スポンサーリンク

概要

• 論文の詳細を見る

• A multiple stream join is one of the most important but high cost operations in ubiquitous streaming services. In this paper, we propose a newly improved and practical algorithm for joining multiple streams called AMJoin, which improves the multiple join performance by guaranteeing the detection of join failures in constant time. To achieve this goal, we first design a new data structure called BiHT (Bit-vector Hash Table) and present the overall behavior of AMJoin in detail. In addition, we show various experimental results and their analyses for clarifying its efficiency and practicability.

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

著者

• Kim Hyeon-gyu

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

• Kim Hyeon‐gyu

  Kaist Daejeon Kor

• KWON Tae-Hyung

  Department of Electrical Engineering and Computer Science, KAIST

• KIM Hyeon-Gyu

  Department of Electrical Engineering and Computer Science, KAIST

• KIM Myoung-Ho

  Department of Electrical Engineering and Computer Science, KAIST

• SON Jin-Hyun

  Department of Computer Science and Engineering, Hanyang University

• KIM Myoung-Ho

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

• Son Jin-hyun

  Department Of Computer Science And Engineering Hanyang University

• Kim Myoung-ho

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

• Kwon Tae-hyung

  Department Of Electrical Engineering And Computer Science Kaist

関連論文

• 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

スポンサーリンク