Query processing of multi-way stream window joins

Moustafa A. Hammad, Walid G. Aref, Ahmed Elmagarmid

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

This paper introduces a class of join algorithms, termed W-join, for joining multiple infinite data streams. W-join addresses the infinite nature of the data streams by joining stream data items that lie within a sliding window and that match a certain join condition. In addition to its general applicability in stream query processing, W-join can be used to track the motion of a moving object or detect the propagation of clouds of hazardous material or pollution spills over time in a sensor network environment. We describe two new algorithms for W-join and address variations and local/global optimizations related to specifying the nature of the window constraints to fulfill the posed queries. The performance of the proposed algorithms is studied experimentally in a prototype stream database system, using synthetic data streams and real time-series data. Tradeoffs of the proposed algorithms and their advantages and disadvantages are highlighted, given variations in the aggregate arrival rates of the input data streams and the desired response times per query.

Original languageEnglish
Pages (from-to)469-488
Number of pages20
JournalVLDB Journal
Volume17
Issue number3
DOIs
Publication statusPublished - 1 May 2008
Externally publishedYes

Fingerprint

Query processing
Joining
Hazardous materials
Hazardous materials spills
Global optimization
Sensor networks
Time series
Pollution

Keywords

  • Multi-way window join
  • Stream query processing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems

Cite this

Query processing of multi-way stream window joins. / Hammad, Moustafa A.; Aref, Walid G.; Elmagarmid, Ahmed.

In: VLDB Journal, Vol. 17, No. 3, 01.05.2008, p. 469-488.

Research output: Contribution to journalArticle

Hammad, Moustafa A. ; Aref, Walid G. ; Elmagarmid, Ahmed. / Query processing of multi-way stream window joins. In: VLDB Journal. 2008 ; Vol. 17, No. 3. pp. 469-488.
@article{0d0fa5e340964949924dd1640c7da0ac,
title = "Query processing of multi-way stream window joins",
abstract = "This paper introduces a class of join algorithms, termed W-join, for joining multiple infinite data streams. W-join addresses the infinite nature of the data streams by joining stream data items that lie within a sliding window and that match a certain join condition. In addition to its general applicability in stream query processing, W-join can be used to track the motion of a moving object or detect the propagation of clouds of hazardous material or pollution spills over time in a sensor network environment. We describe two new algorithms for W-join and address variations and local/global optimizations related to specifying the nature of the window constraints to fulfill the posed queries. The performance of the proposed algorithms is studied experimentally in a prototype stream database system, using synthetic data streams and real time-series data. Tradeoffs of the proposed algorithms and their advantages and disadvantages are highlighted, given variations in the aggregate arrival rates of the input data streams and the desired response times per query.",
keywords = "Multi-way window join, Stream query processing",
author = "Hammad, {Moustafa A.} and Aref, {Walid G.} and Ahmed Elmagarmid",
year = "2008",
month = "5",
day = "1",
doi = "10.1007/s00778-006-0017-y",
language = "English",
volume = "17",
pages = "469--488",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Query processing of multi-way stream window joins

AU - Hammad, Moustafa A.

AU - Aref, Walid G.

AU - Elmagarmid, Ahmed

PY - 2008/5/1

Y1 - 2008/5/1

N2 - This paper introduces a class of join algorithms, termed W-join, for joining multiple infinite data streams. W-join addresses the infinite nature of the data streams by joining stream data items that lie within a sliding window and that match a certain join condition. In addition to its general applicability in stream query processing, W-join can be used to track the motion of a moving object or detect the propagation of clouds of hazardous material or pollution spills over time in a sensor network environment. We describe two new algorithms for W-join and address variations and local/global optimizations related to specifying the nature of the window constraints to fulfill the posed queries. The performance of the proposed algorithms is studied experimentally in a prototype stream database system, using synthetic data streams and real time-series data. Tradeoffs of the proposed algorithms and their advantages and disadvantages are highlighted, given variations in the aggregate arrival rates of the input data streams and the desired response times per query.

AB - This paper introduces a class of join algorithms, termed W-join, for joining multiple infinite data streams. W-join addresses the infinite nature of the data streams by joining stream data items that lie within a sliding window and that match a certain join condition. In addition to its general applicability in stream query processing, W-join can be used to track the motion of a moving object or detect the propagation of clouds of hazardous material or pollution spills over time in a sensor network environment. We describe two new algorithms for W-join and address variations and local/global optimizations related to specifying the nature of the window constraints to fulfill the posed queries. The performance of the proposed algorithms is studied experimentally in a prototype stream database system, using synthetic data streams and real time-series data. Tradeoffs of the proposed algorithms and their advantages and disadvantages are highlighted, given variations in the aggregate arrival rates of the input data streams and the desired response times per query.

KW - Multi-way window join

KW - Stream query processing

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

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

U2 - 10.1007/s00778-006-0017-y

DO - 10.1007/s00778-006-0017-y

M3 - Article

VL - 17

SP - 469

EP - 488

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 3

ER -