Nearest Neighbor Secure Query Research for Spatial Road Network Data

DOI

10.2991/wcnme-19.2019.21How to use a DOI?

Keywords

location-based services; information protection; PHC; nearest neighbor query

Abstract

The nearest neighbor secure query of spatial road network data is a combination of cloud storage technology and geographic location-based services. According to the position information of interest points in space, the Voronoi diagram is used to construct a polygon block to divide space into multiple adjacent spatial units and replace the space midpoint information with block information for achieving road network data position information protection. The spatial region can be divided into multiple sub-regions based on the spatial unit. After receiving the request from the user to issue a query, the part half cut method (PHC) is proposed to divide the entire space area according to the attributes of the interest points. And then using a structured way to create a memory index by Quad-tree and R-tree, then realize nearest neighbor query. In order to improve the query efficiency, the memory hash table for establishing space units and partitions is proposed, and a fast search is performed by directly searching the storage locations of the space units. The comparative experiments show that PHC has the highest query efficiency.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ying Li
PY  - 2019/06
DA  - 2019/06
TI  - Nearest Neighbor Secure Query Research for Spatial Road Network Data
BT  - Proceedings of the 2019 International Conference on Wireless Communication, Network and Multimedia Engineering (WCNME 2019)
PB  - Atlantis Press
SP  - 87
EP  - 90
SN  - 2352-538X
UR  - https://doi.org/10.2991/wcnme-19.2019.21
DO  - 10.2991/wcnme-19.2019.21
ID  - Li2019/06
ER  -