Parallelizing windowed stream joins in a shared-nothing cluster

The availability of a large number of processing nodes in a parallel and distributed computing environment enables sophisticated real time processing over high speed data streams, as required by many emerging applications. Sliding window stream joins are among the most important operators in a stream processing system. In this paper, we consider the issue of parallelizing a sliding window stream join operator over a shared nothing cluster. We propose a Bulk Synchronous Processing (BSP) framework, based on a fixed or predefined sequence of communication, to distribute the join processing loads over a shared-nothing cluster. We consider various processing and communication overheads while scaling over a large number of nodes, and propose solution methodologies to cope with the issues.We implement the algorithm over a cluster using a message passing system, and present the experimental results showing the effectiveness of the join processing algorithm.