Stream window join: tracking moving objects in sensor-network databases

  • Authors:
  • Moustafa A. Hammad;Walid G. Aref;Ahmed K. Elmagarmid

  • Affiliations:
  • Purdue University;Purdue University;Hewlett Packard

  • Venue:
  • SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The widespread use of sensor networks presents revolutionary opportunities for life and environmental science applications. Many of these applications involve continuous queries that require the tracking, monitoring, and correlation of multi-sensor data that represent moving objects. We propose to answer these queries using a multi-way stream window join operator. This form of join over multi-sensor data must cope with the infinite nature of sensor data streams and the delays in network transmission. 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. 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 are 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 high-lighted, given variations in the aggregate arrival rates of the input data streams and the desired response times per query.