Efficient Multidimensional Top- Query Processing in Wireless Multihop Networks

Algorithm 3

Filter construction.

   Input:  

   Output:  

(1) /* Node, , constructs a filter from a query sent by  */

(2) local top-k data←

(3) 

(4) 

(5)  for  ∈   do

(6)   if   is within search range  then

(7)     if    then

(8)       ← ∪ score(),

(9)        's -skyband, score()

(10)       ∪ score(),

(11)      ’s -skyband, score() (

(12) Sort and by ascending order

(13) lm_data

(14) if   + 1  then

(15)  for   to + 1 −    do

(16)    lm_data←lm_data  ,

(17) mu_data

(18) if     then

(19)  for   to   do

(20)    mu_data  mu_data ∪ , −()}

(21) Calculate local top-k data from its own data and neighbors’ -skyband within search range

(22) local top-k data  local top-k data ∪  ∪ me ∪  ∪ ub

(23) Sort local top-k data by ascending order

(24) ←local top-k

(25) ←local top-k

(26)

(27) while    do

(28)  

(29)   top-k

(30) ←local top-k

(31)

(32) while    do

(33)  

(34)  ←local top-k