Authors: D. Zeinalipour-Yazti, Z. Vagena, D. Gunopulos, V. Kalogeraki, V. Tsotras, M. Vlachos, N. Koudas, D. Srivastava
Title: The Threshold Join Algorithm for Top-k Queries in Distributed Sensor Networks
Conference: Proceedings of the 2nd international workshop on Data management for sensor networks DMSN (VLDB'2005),
Year: 2005
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 sen-
sor 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 central-
ized fashion, which minimizes even more the consumption
of bandwidth and delay. Our preliminary experimental re-
sults, using our trace driven simulator, show that TJA is
both practical and efficient.
[Download]
Back