A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scalable stream join processing with expensive predicates
2009
Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09
Multi-way stream joins with expensive join predicates lead to great challenge for real-time (or close to real-time) stream processing. Given the memory-and CPU-intensive nature of such stream join queries, scalable processing on a cluster must be employed. This paper proposes a novel scheme for distributed processing of generic multi-way joins with window constraints, called Pipelined State Partitioning (PSP). We target generic joins with arbitrarily join conditions, which are used in
doi:10.1145/1516360.1516396
dblp:conf/edbt/WangR09
fatcat:oy4dz72jnfbrle4vzcu254hwbi