Spatial Exact Match Query Based on the NA-Tree Approach in P2P Systems

Authors:
Ye-In Chang;Chen-Chang Wu;Ching-I Wang
Affiliations:
Dept. of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, Republic of China;Dept. of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, Republic of China;Dept. of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, Republic of China
Venue:
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Year:
2009

Citing 3
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A New Tree Type Data Structure with Homogeneous Nodes Suitable for a Very Large Spatial Database

Proceedings of the Sixth International Conference on Data Engineering
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine the NA---tree with the Chord system to solve the overlapping problem which the P2PR---tree can not deal with. From our simulation results, we show that the number of visited peers in our approach is less than that in the P2PR---tree.