Approximating streaming window joins under CPU limitations

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 142-

  Ayad, Ahmed ^a   Naughton, Jeffrey ^a   Wright, Stephen ^a   Srivastava, Utkarsh ^b  

^a University of Wisconsin Madison   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COIN FLIPPING STRATEGY; LOAD SHEDDING; MEMORY RESOURCE; PRODUCTION OPERATIONS;

APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; PROGRAM PROCESSORS; SEMANTICS;

DATA TRANSFER;

EID: 33749619098     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.24     Document Type: Conference Paper

References (7)

1. A. Ayad, J. Naughton, S. Wright, and U. Srivastava. Approximating streaming window joins under cpu limitations. Technical report, Department of Computer Sciences, University of Wisconsin - Madison, 2005.
2. A. Ayad and J. F. Naughton. Static optimization of conjunctive queries with sliding windows over infinite streams. In SIGMOD Conference, pages 419-430, 2004.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS, pages 1-16, 2002.
4. S. Chaudhuri, R. Motwani, and V. R. Narasayya. On random sampling over joins. In SIGMOD Conference, pages 263-274, 1999.
5. A. Das, J. Gehrke, and M. Riedewald. Approximate join processing over data streams. In SIGMOD Conference, pages 40-51, 2003.
6. J. Kang, J. F. Naughton, and S. Viglas. Evaluating window joins over unbounded streams. In ICDE, pages 341-352, 2003.
7. U. Srivastava and J. Widom. Memory-limited execution of windowed stream joins. In VLDB, pages 324-335, 2004.