Overcoming memory limitations in high-throughput event-based applications
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.00 |
We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding loads, and therefore cannot provide exact or even highly accurate results for sliding window joins over data streams showing time varying rate of data arrivals. We provide an Exact Window Join (EWJ) algorithm incorporating disk storage as an archive. Our algorithm spills window data onto the disk on a periodic basis, refines the output result by properly retrieving the disk resident data, and maximizes output rate by employing techniques to manage the memory blocks. The problem of managing the window blocks in memory--similar in nature to the caching issue--captures both the temporal and frequency related properties of the stream arrivals. At the same, we improve I/O efficiency by amortizing a disk scan over a large number of input tuple. We provide experimental results demonstrating the performance and effectiveness of the proposed algorithm.