Proceedings of the VLDB Endowment · 2014 · 48 citations · 17 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureDatabasesParallel ComputingCommunication OverheadData ParallelismInterprocess CommunicationLatency OptimizationScalable Algorithm DesignStream ProcessingJoin OrderingParallel Join AlgorithmsParallel Stream ProcessingStream JoinsStreaming ArchitecturesStreaming Data ProcessingThroughput
This work revisits the processing of stream joins on modern hardware architectures. Our work is based on the recently proposed handshake join algorithm, which is a mechanism to parallelize the processing of stream joins in a NUMA-aware and hardware-friendly manner. Handshake join achieves high throughput and scalability, but it suffers from a high latency penalty and a non-deterministic ordering of the tuples in the physical result stream. In this paper, we first characterize the latency behavior of the handshake join and then propose a new low-latency handshake join algorithm, which substantially reduces latency without sacrificing throughput or scalability. We also present a technique to generate punctuated result streams with very little overhead; such punctuations allow the generation of correctly ordered physical output streams with negligible effect on overall throughput and latency.
17
Aurora: a new model and architecture for data stream management
Daniel J. Abadi, Don Carney, Ugur �etintemel et al. · The VLDB Journal · 2003 · 1.5K citations
Andrew Baumann, Paul Barham, Pierre-Évariste Dagand et al. · 2009 · 797 citations
Evaluating window joins over unbounded streams
Jaewoo Kang, Jeffrey F. Naughton, Stratis D. Viglas · 2004 · 355 citations
Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware
Çagri Balkesen, Jens Teubner, Gustavo Alonso et al. · 2013 · 271 citations