Approximating StreamingWindow Joins Under CPU Limitations

Authors:
Ahmed Ayad;Jeffrey Naughton;Stephen Wright;Utkarsh Srivastava
Affiliations:
University of Wisconsin - Madison;University of Wisconsin - Madison;University of Wisconsin - Madison;Stanford University
Venue:
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Year:
2006

Citing 0
Cited 3

Load Shedding for Shared Window Join over Real-Time Data Streams

APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
A load shedding framework for XML stream joins

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Scalable keyword search on large data streams

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.