Efficient joins of multiple data streams : fast joins and load shedding = 다중 데이터 스트림에서 효율적인 조인 : 빠른 조인 알고리즘과 부하 감소 기법 fast joins and load shedding

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 329
  • Download : 0
There are growing researches for processing of continuous queries over a set of data streams from multiple data sources. These are indispensable to ubiquitous streaming applications, such as IP or sensor network monitoring, moving objects trajectory, and many others. These stream applications require real-time, or near real-time response for very high arrival rates. But, system resources may not be available for the run-time state required by numerous queries. In the first part of this dissertation, we propose a newly improved and practical algorithm for multiple windowed join 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. In the next part of this dissertation, we address the problem of load shedding for continuous multi-way join queries over multiple data streams. When the arrival rates of tuples from data streams exceed the system capacity, a load shedding algorithm drops some subset of input tuples to avoid system overloads. To decide which tuples to drop among the input tuples, most existing load shedding algorithms determine the priority of each input tuple based on the frequency or some historical statistics of its join attribute value, and then drop tuples with the lowest priority.However, those v$\It{value-based }$ algorithms cannot determine the priority of tuples properly in environments where join attribute values are unique and each join attribute value occurs at most once in each data stream. In this dissertation, we propose an load shedding algorithm based on $\It{arrival order patterns}$ for multi-way stream joins in such environments. The proposed load shedding algorithm determines the priority of eac...
Advisors
Kim, Myoung Horesearcher김명호researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
418762/325007 / 020065015
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 2010.2, [ viii, 54 p. ]

Keywords

load shedding; bit-vector; hash join; multiple stream join; arrival order; 도착순서; 부하감소; 비트벡터; 해시조인; 다중스트림조인

URI
http://hdl.handle.net/10203/33296
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=418762&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0