论文信息 - Approximating StreamingWindow Joins Under CPU Limitations

Approximating StreamingWindow Joins Under CPU Limitations

Data streaming systems face the possibility of having to shed load in the case of CPU or memory resource limitations. We study the CPU limited scenario in detail. First, we propose a new model for the CPU cost. Then we formally state the problem of shedding load for the goal of obtaining the maximum possible subset of the complete answer, and propose an online strategy for semantic load shedding. Moving on to random load shedding, we discuss random load shedding strategies that decouple the window maintenance and tuple production operations of the symmetric hash join, and prove that one of them — Probe-No-Insert — always dominates the previously proposed coin flipping strategy.

[1] Rajeev Motwani,et al. On random sampling over joins , 1999, SIGMOD '99.

[2] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.

[3] Jeffrey F. Naughton,et al. Evaluating window joins over unbounded streams , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[4] Abhinandan Das,et al. Approximate join processing over data streams , 2003, SIGMOD '03.

[5] Jennifer Widom,et al. Memory-Limited Execution of Windowed Stream Joins , 2004, VLDB.

[6] Jeffrey F. Naughton,et al. Static optimization of conjunctive queries with sliding windows over infinite streams , 2004, SIGMOD '04.

[7] Roger Barga,et al. Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDE 2006, 3-7 April 2006, Atlanta, GA, USA , 2006, ICDE Workshops.