Spatial Range Query on Group P2P Networks

Author(s):  
Dan Liu ◽  
Wenjun Xie
2012 ◽  
Vol 263-266 ◽  
pp. 2308-2313
Author(s):  
Hong Bo Xu ◽  
Nian Min Yao

The performance of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file and NB-tree suffers greatly in high-dimensional space. So the reduction of the dimensionality is the key to the spatial range query in high-dimensional space. The paper uses the parallel technique to present a spatial range query parallel algorithm in high-dimensional space. The algorithm transforms d-dimensional spatial range query to the linear space on d slave node processors. The d slave node processors run parallel. The master node processor only need calculate the union of d results which d slave node processors return. The experimental results indicate that its performance is better than that of the spatial range query algorithms based on Brute-Force method, R-tree, VA-file, NB-tree.


2015 ◽  
Vol 8 (12) ◽  
pp. 1382-1393 ◽  
Author(s):  
Parth Nagarkar ◽  
K. Selçuk Candan ◽  
Aneesha Bhat
Keyword(s):  

Author(s):  
Qian Meng ◽  
Jian Weng ◽  
Yinbin Miao ◽  
Kefei Chen ◽  
Zhonghua Shen ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document