An exhaustive algorithm based on GPU to process a kNN query

Author(s):  
Javier A. Riquelme ◽  
Ricardo J. Barrientos ◽  
Ruber Hernandez-Garcia ◽  
Cristobal A. Navarro
Keyword(s):  
Author(s):  
Ricardo J. Barrientos ◽  
Javier A. Riquelme ◽  
Ruber Hernández-García ◽  
Cristóbal A. Navarro ◽  
Wladimir Soto-Silva
Keyword(s):  

Author(s):  
Ricardo J. Barrientos ◽  
José I. Gómez ◽  
Christian Tenllado ◽  
Manuel Prieto Matias ◽  
Mauricio Marin

2008 ◽  
Author(s):  
Yang Lu ◽  
Bin Cui ◽  
Jiakui Zhao ◽  
Hua Lu ◽  
Jialie Shen

2012 ◽  
Vol 17 (5) ◽  
pp. 973-985 ◽  
Author(s):  
Thao P. Nghiem ◽  
Agustinus Borgy Waluyo ◽  
David Taniar

2008 ◽  
Vol 20 (12) ◽  
pp. 1655-1668 ◽  
Author(s):  
Shan-Hung Wu ◽  
Kun-Ta Chuang ◽  
Chung-Min Chen ◽  
Ming-Syan Chen

2014 ◽  
Vol 10 (4) ◽  
pp. 385-405 ◽  
Author(s):  
Yuka Komai ◽  
Yuya Sasaki ◽  
Takahiro Hara ◽  
Shojiro Nishio

In a kNN query processing method, it is important to appropriately estimate the range that includes kNNs. While the range could be estimated based on the node density in the entire network, it is not always appropriate because the density of nodes in the network is not uniform. In this paper, we propose two kNN query processing methods in MANETs where the density of nodes is ununiform; the One-Hop (OH) method and the Query Log (QL) method. In the OH method, the nearest node from the point specified by the query acquires its neighbors' location and then determines the size of a circle region (the estimated kNN circle) which includes kNNs with high probability. In the QL method, a node which relays a reply of a kNN query stores the information on the query result for future queries.


2014 ◽  
Vol 26 (11) ◽  
pp. 2818-2831 ◽  
Author(s):  
Sunoh Choi ◽  
Gabriel Ghinita ◽  
Hyo-Sang Lim ◽  
Elisa Bertino

2016 ◽  
Vol 10 (6) ◽  
pp. 137-154 ◽  
Author(s):  
Huan Zhao ◽  
Jiaolong Wan ◽  
Zuo Chen
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document