Spatial Exact Match Query in P2P Systems Using an NA-Tree Structure

Abstract

Spatial data occur in several important and diverse applications in P2P systems, for example, P2P virtual cities, GIS, development planning, etc. 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.