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. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Chang, Y. I., Wu, C. C., & Wang, C. I. (2009). Spatial exact match query based on the NA-tree approach in P2P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5579 LNAI, pp. 409–418). https://doi.org/10.1007/978-3-642-02568-6_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
