Research on cost-efficient processing of continuous extreme queires

Authors:
Xuehui Kong;Shuyang Wang;Yuehua Li;Tian Li
Affiliations:
College of Mechanical and Electrical Engineering , Northeast Forestry University, Harbin, China;College of Mechanical and Electrical Engineering , Northeast Forestry University, Harbin, China;College of Mechanical and Electrical Engineering , Northeast Forestry University, Harbin, China;College of Mechanical and Electrical Engineering , Northeast Forestry University, Harbin, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 12
Cited 0

Eddies: continuously adaptive query processing

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Adaptive precision setting for cached approximate values

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Adaptive filters for continuous queries over distributed data streams

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Adaptive stream resource management using Kalman Filters

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty

Proceedings of the 2005 ACM symposium on Applied computing
Sketching streams through the net: distributed approximate query tracking

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Energy-efficient monitoring of extreme values in sensor networks

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Streaming in a connected world: querying and tracking distributed data streams

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Research on prediction models over distributed data streams

WISE'06 Proceedings of the 7th international conference on Web Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of cost-efficient processing of continuous extreme queires (MAX or MIN) over distributed sliding window streams, and propose several methods for communication reduction and resource sharing among queries. Firstly, we develop an effective pruning technique to minimize the number of elements to be kept. It can be shown that on average only O(logN) key points need to be stored for exact answer of extreme query, where N is the number of points contained in the sliding window. Then we consider the distributed environment, where remote nodes delay the data transmission as late as possible, and adopt the pruning strategy to filter local stream tuples, which is quite efficient in communication reduction. Analytical analysis and experimental evidences show the efficiency of proposed approach both on storage/communication reduction and efficiency improvement.