http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
데이터 스트림에서 그래프 기반 기법을 이용한 슬라이딩 윈도우 다중 조인 처리
장량(Liang Zhang),유병섭(Byeong Seob You),거준위(Jun Wei Ge),김경배(Gyung Bae Kim),이순조,배해영(Hae Young Bae) 대한공간정보학회 2007 한국공간정보시스템학회 논문지 Vol.9 No.2
Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency in some applications. The graph-based sliding window multi-join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure. The advantages of our algorithm are proved by the performance comparison with existing join algorithms.