The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Semantic Caching in Location-Dependent Query Processing
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A New Spatial Index Structure for Efficient Query Processing in Location Based Services
SUTC '10 Proceedings of the 2010 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
Friendship and mobility: user movement in location-based social networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
A path nearest neighbor (PNN) query finds the closest objects from paths consisting of line segments. The existing method has redundant searches as a problem. In this paper, we propose PNN methods that avoid redundant searches in an index. In order to avoid redundant searches, the proposed methods find the closest objects from a path sequentially and determine whether the next closest object is found. To prove the superiority of the proposed methods, we evaluate their performance.