Scheduling for shared window joins over data stream

Moustafa A. Hammad, Michael J. Franklin, Walid G. Aref, Ahmed Elmagarmid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

93 Citations (Scopus)

Abstract

Continuous Query (CQ) systems typically exploit commonality among query expressions to achieve improved efficiency through shared processing. Re cently proposed CQ systems have introduced window specifications in order to support unbounded data streams. There has been, however, little investigation of sharing for windowed query operators. In this paper, we address the shared execution of windowed joins, a core operator for CQ sys tems. We show that the strategy used in systems to date has a previously unreported performance flaw that can negatively impact queries with relatively small windows. We then propose two new execution strategies for shared joins. We evaluate the alternatives using both analytical model and implementation in a DBMS. The results show that one strategy, called MQT, provides the best performance over a range of workload settings.

Original languageEnglish
Title of host publicationProceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
PublisherMorgan Kaufmann
Pages297-308
Number of pages12
ISBN (Electronic)0127224424, 9780127224428
Publication statusPublished - 1 Jan 2003
Externally publishedYes
Event29th International Conference on Very Large Data Bases, VLDB 2003 - Berlin, Germany
Duration: 9 Sep 200312 Sep 2003

Other

Other29th International Conference on Very Large Data Bases, VLDB 2003
CountryGermany
CityBerlin
Period9/9/0312/9/03

Fingerprint

Analytical models
Scheduling
Specifications
Defects
Processing
Continuous queries
Join
Query
Data streams
Operator
Database management systems
Commonality
Workload
Analytical model

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Information Systems and Management
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Hammad, M. A., Franklin, M. J., Aref, W. G., & Elmagarmid, A. (2003). Scheduling for shared window joins over data stream. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003 (pp. 297-308). Morgan Kaufmann.

Scheduling for shared window joins over data stream. / Hammad, Moustafa A.; Franklin, Michael J.; Aref, Walid G.; Elmagarmid, Ahmed.

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. p. 297-308.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hammad, MA, Franklin, MJ, Aref, WG & Elmagarmid, A 2003, Scheduling for shared window joins over data stream. in Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, pp. 297-308, 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, 9/9/03.
Hammad MA, Franklin MJ, Aref WG, Elmagarmid A. Scheduling for shared window joins over data stream. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann. 2003. p. 297-308
Hammad, Moustafa A. ; Franklin, Michael J. ; Aref, Walid G. ; Elmagarmid, Ahmed. / Scheduling for shared window joins over data stream. Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. pp. 297-308
@inproceedings{6b47a5fd60cb4923a973d58bdfa4770c,
title = "Scheduling for shared window joins over data stream",
abstract = "Continuous Query (CQ) systems typically exploit commonality among query expressions to achieve improved efficiency through shared processing. Re cently proposed CQ systems have introduced window specifications in order to support unbounded data streams. There has been, however, little investigation of sharing for windowed query operators. In this paper, we address the shared execution of windowed joins, a core operator for CQ sys tems. We show that the strategy used in systems to date has a previously unreported performance flaw that can negatively impact queries with relatively small windows. We then propose two new execution strategies for shared joins. We evaluate the alternatives using both analytical model and implementation in a DBMS. The results show that one strategy, called MQT, provides the best performance over a range of workload settings.",
author = "Hammad, {Moustafa A.} and Franklin, {Michael J.} and Aref, {Walid G.} and Ahmed Elmagarmid",
year = "2003",
month = "1",
day = "1",
language = "English",
pages = "297--308",
booktitle = "Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003",
publisher = "Morgan Kaufmann",

}

TY - GEN

T1 - Scheduling for shared window joins over data stream

AU - Hammad, Moustafa A.

AU - Franklin, Michael J.

AU - Aref, Walid G.

AU - Elmagarmid, Ahmed

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Continuous Query (CQ) systems typically exploit commonality among query expressions to achieve improved efficiency through shared processing. Re cently proposed CQ systems have introduced window specifications in order to support unbounded data streams. There has been, however, little investigation of sharing for windowed query operators. In this paper, we address the shared execution of windowed joins, a core operator for CQ sys tems. We show that the strategy used in systems to date has a previously unreported performance flaw that can negatively impact queries with relatively small windows. We then propose two new execution strategies for shared joins. We evaluate the alternatives using both analytical model and implementation in a DBMS. The results show that one strategy, called MQT, provides the best performance over a range of workload settings.

AB - Continuous Query (CQ) systems typically exploit commonality among query expressions to achieve improved efficiency through shared processing. Re cently proposed CQ systems have introduced window specifications in order to support unbounded data streams. There has been, however, little investigation of sharing for windowed query operators. In this paper, we address the shared execution of windowed joins, a core operator for CQ sys tems. We show that the strategy used in systems to date has a previously unreported performance flaw that can negatively impact queries with relatively small windows. We then propose two new execution strategies for shared joins. We evaluate the alternatives using both analytical model and implementation in a DBMS. The results show that one strategy, called MQT, provides the best performance over a range of workload settings.

UR - http://www.scopus.com/inward/record.url?scp=85012119096&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012119096&partnerID=8YFLogxK

M3 - Conference contribution

SP - 297

EP - 308

BT - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

PB - Morgan Kaufmann

ER -