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
We study the problem of static optimization of conjunctive queries with sliding window joins over unbounded streaming information sources. While previous work has suggested focusing on maximizing the output rate of queries over streaming information sources, we show that in steady-state, for conjunctive queries with sliding windows over unbounded streams, all feasible plans have the same output rate. For this reason, we suggest that the goal of optimization for such queries should be todoi:10.1145/1007568.1007616 dblp:conf/sigmod/AyadN04 fatcat:6xco5h2vvzbypioiuujmf7xgse