By Topic

Maximizing Throughput for Queries over Streaming Sensor Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Joseph Gomes ; Department of Computer Science, The George Washington University, Washington, DC, USA. Email: joegomes@gwu.edu ; Hyeong-ah Choi

Sensors are becoming ubiquitous, and increasingly integrated with our lives. Sensors usually send sampled data periodically using wireless connections to server machines. The servers perform various operations (e.g. filter, aggregate, join etc) on this data in real-time according to predefined queries or rules. In this paper, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We develop a dynamic programming algorithm OptDP, that produces an optimal tree but runs in an exponential time in the number of input streams. We then present a polynomial time greedy algorithm XGreedyJoin. Our experiments in ARES show that for almost all instances, trees from XGreedyJoin perform close to the optimal trees from OptDP, and significantly better than existing XJoin based heuristic algorithms

Published in:

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems

Date of Conference:

Oct. 2006