Research On Related Spatial Queries Based On Voronoi Diagram

In today's big data era,how to better manage spatial data and complete corresponding query operations has become a problem of concern.Therefore,spatial data index technology and corresponding query methods have become the research focus of scholars.Among them,directional region query and nearest neighbor query,as important branches in the field of spatial query,have been widely used in transportation planning,logistics management Geographic information system.In this paper,the structural properties of Voronoi diagram are used to study the relevant spatial query algorithm.It mainly includes the research of index structure based on Voronoi diagram,the research of direction region query method based on Voronoi diagram,and the research of K-nearest neighbor query and continuous nearest neighbor query method based on Voronoi diagram index structure.Firstly,for spatial data query,an index structure based on Voronoi diagram is proposed by using the structural characteristics of Voronoi diagram.In order to obtain structural information,Voronoi diagram is generated indirectly by using spatial data to form Delaunay triangulation.At the same time,relevant information is saved in the execution process,and finally an index structure based on Voronoi diagram is formed.Secondly,based on the Voronoi diagram index structure,according to the properties of direction region query and the structural characteristics of Voronoi diagram,the decision rules are designed,and the direction region query algorithm based on Voronoi diagram is given.This method is extended according to the adjacency characteristics of the generated points in the Voronoi diagram,which greatly reduces the determination times of irrelevant nodes,so as to obtain the correct query results and reduce the time consumption in the query process.Through theoretical analysis and experimental data,it can be seen that the algorithm has good performance for direction region query.Finally,on the basis of the Voronoi diagram index structure,based on k nearest neighbor query and the nature of the continuous nearest neighbor query and use the Voronoi diagram the null point distance and involves the regional design corresponding query process and rules,the use of index structure based on Voronoi diagram for k nearest neighbor query and continuous nearest neighbor query.Theoretical research and experimental data show that both algorithms have good performance in their respective query fields.