Paper Info
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.
Year
DOI
Venue
2008
10.1007/s00778-006-0017-y
The Vldb Journal
Keywords
Field
DocType
Stream query processing,Multi-way window join
Data mining,Joins,Data stream mining,Sliding window protocol,Computer science,Sensor array,Response time,Synthetic data,STREAMS,Wireless sensor network,Database
Journal
Volume
Issue
ISSN
17
3
1066-8888
Citations 
PageRank 
References 
6
0.45
27
Authors
3
Name
Order
Citations
PageRank
Moustafa A. Hammad129719.61
Walid G. Aref24502419.49
Ahmed K. Elmagarmid33720626.92