The threshold join algorithm for top-k queries in distributed sensor networks

Authors:
D. Zeinalipour-Yazti;Z. Vagena;D. Gunopulos;V. Kalogeraki;V. Tsotras;M. Vlachos;N. Koudas;D. Srivastava
Affiliations:
University of California, Riverside, CA;University of California, Riverside, CA;University of California, Riverside, CA;University of California, Riverside, CA;University of California, Riverside, CA;IBM T.J Watson Research, Hawthorne, NY;University of Toronto, Toronto, ON, Canada;AT&T Research Labs, Florham Park, NJ
Venue:
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
Year:
2005

Citing 9
Cited 20

Combining fuzzy information from multiple systems (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed top-k monitoring

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The design of an acquisitional query processor for sensor networks

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating Top-k Queries over Web-Accessible Databases

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient top-K query calculation in distributed networks

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
KLEE: a framework for distributed top-k query algorithms

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Data Acquisition in Sensor Networks with Large Memories

ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops

Distributed spatio-temporal similarity search

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient indexing data structures for flash-based sensor devices

ACM Transactions on Storage (TOS)
Top-k Monitoring in Wireless Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Outlier detection in sensor networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Better tree - better fruits: using dominating set trees for MAX queries

Proceedings of the 5th workshop on Data management for sensor networks
POT: an efficient top-k monitoring method for spatially correlated sensor readings

Proceedings of the 5th workshop on Data management for sensor networks
The d-hop k-data coverage query problem in wireless sensor networks

Proceedings of the 5th workshop on Data management for sensor networks
A substrate for in-network sensor data integration

Proceedings of the 5th workshop on Data management for sensor networks
Optimizing Distributed Top-k Queries

WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Finding the K highest-ranked answers in a distributed network

Computer Networks: The International Journal of Computer and Telecommunications Networking
Ranking distributed probabilistic data

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Distributed top-k aggregation queries at large

Distributed and Parallel Databases
Middleware for reliable real-time sensor data management

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Energy-efficient top-k query processing in wireless sensor networks

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Optimized query routing trees for wireless sensor networks

Information Systems
Top-k query evaluation in sensor networks under query response time constraint

Information Sciences: an International Journal
Dynamic join optimization in multi-hop wireless sensor networks

Proceedings of the VLDB Endowment
Power efficiency through tuple ranking in wireless sensor network monitoring

Distributed and Parallel Databases
Distributed adaptive top-k monitoring in wireless sensor networks

Journal of Systems and Software
Approximate top-k queries in sensor networks

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query is to find the k highest ranked answers to a user defined similarity function. The evaluation of such a query in a sensor network environment is associated with the transfer of data over an extremely expensive communication medium. TJA uses a non-uniform threshold on the queried attribute in order to minimize the number of tuples that have to be transferred towards the querying node. Additionally, TJA resolves queries in the network rather than in a centralized fashion, which minimizes even more the consumption of bandwidth and delay. Our preliminary experimental results, using our trace driven simulator, show that TJA is both practical and efficient.