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

• DOI: 10.1145/1080885.1080896
• Publication Date: 2005-11-07T17:34:39Z
• Authors: D. Zeinalipour-Yazti; Z. Vagena; D. Gunopulos; V. Kalogeraki; V. Tsotras; M. Vlachos; N. Koudas; D. Srivastava
• Keywords: Join (topology); TRACE (psycholinguistics); Similarity (geometry)

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 to find k highest ranked answers user defined similarity function. evaluation such in network environment associated with transfer data over extremely expensive communication medium. TJA uses non-uniform threshold on queried attribute order minimize number tuples that have be transferred towards querying node. Additionally, resolves queries rather than centralized fashion, minimizes even more consumption bandwidth and delay. Our preliminary experimental results, using our trace driven simulator, show both practical efficient.