Algorithms for Sliding Window Join over Distributed Data Stream
Jiangbo Qian
Abstract
Jiangbo Qian
Abstract
Distributed processing is a very promising route towards a more effective and adaptive data stream processing model.This paper studies window join over data streams,which is an important class of continuous operators for distributed processing.A novel distributed join approach named DM3Join is proposed.DM3Join consists of two parts.One is to decompose concurrent join query,merge the same join predicate and form distributed join operator.The other is to implement part join based on moving of data stream through distributed agent,and form final results in query engine.Different from most of other algorithms,the algorithm executes window joins performs like a router and needs only one scan over the data streams since different join queries share the intermediate results.The experimental results show that the algorithm is effective.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Distributed processing is a very promising route towards a more effective and adaptive data stream processing model.This paper studies window join over data streams,which is an important class of continuous operators for distributed processing.A novel distributed join approach named DM3Join is proposed.DM3Join consists of two parts.One is to decompose concurrent join query,merge the same join predicate and form distributed join operator.The other is to implement part join based on moving of data stream through distributed agent,and form final results in query engine.Different from most of other algorithms,the algorithm executes window joins performs like a router and needs only one scan over the data streams since different join queries share the intermediate results.The experimental results show that the algorithm is effective.
Key concepts: Computer science, Joins, Join (topology), Merge (version control), Sort-merge join, Hash join, Distributed computing, Sliding window protocol