The threshold join algorithm for top-k queries in distributed sensor networks
Date
2005Author
Zeinalipour-Yazdi, Constantinos D.Vagena, Zografoula
Gunopulos, Dimitrios
Kalogeraki, Vana
Tsotras, Vassilis J.
Vlachos, Michail
Koudas, Nick
Srivastava, D.
ISBN
1-59593-206-2978-1-59593-206-8
Source
ACM International Conference Proceeding Series2nd International Workshop on Data Management for Sensor Networks, DMSN 2005, Held in Conjunction with Very Large Data Bases
Volume
96Pages
61-66Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
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. Copyright 2005 ACM.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
Optimized query routing trees for wireless sensor networks
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Pamboris, Andreas; Chrysanthis, Panos K.; Samaras, George S. (2011)In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
-
Conference Object
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
Costa, Constantinos; Laoudias, Christos; Zeinalipour-Yazdi, Constantinos D.; Gunopulos, Dimitrios (2011)In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participating users. Our framework, exploits opportunistic ...
-
Conference Object
KSpot: Effectively monitoring the k most important events in a wireless sensor network
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Vassiliadou, M.; Chrysanthis, Panos K.; Samaras, George S. (2009)This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. KSpot deploys state-of-the-art distributed ...