Spatial index structure tree based method and device for providing results of searching spatial objects

Abstract

The invention aims to provide a spatial index structure tree based method and device for providing results of searching spatial objects. The method includes: acquiring a candidate spatial index structure tree; according to a predetermined unit area threshold, subjecting leaf nodes of the candidate spatial index structure tree to node decomposition until a spatial index structure tree is obtained; acquiring a spatial object query request from a user; according to a query area, performing area matching querying on the spatial index structure tree to obtain matching nodes; according to the query request, performing object matching querying on the spatial objects of the matching nodes to obtain spatial object searching results; providing the user with the spatial object searching results. Compared to the prior art, the method and device has the advantages that area matching querying is performed on the spatial index structure tree to obtain the matching nodes according to the spatial object query object from the user, object matching querying is performed on the spatial objects of the matching nodes to obtain the spatial object searching results according to the query request, and the spatial objects can be searched more efficiently.

Description

technical field [0001] The invention relates to the technical field of network search, in particular to a technology for providing spatial object search results based on a spatial index structure tree. Background technique [0002] With the development of Internet applications, the application of location-based services (Location Based Services, LBS) has brought many conveniences to people's lives. For example, people can query spatial objects such as restaurants, tourist places, libraries, etc. through the LBS platform anytime and anywhere. Geographical location and traffic routes and other information. However, in the existing R-tree that implements the spatial index structure, the spatial regions corresponding to its sibling nodes may overlap, and the spatial index may need to search multiple paths before obtaining the final spatial object search result. For example, when searching and giving When all spatial objects intersected by a given query area, the spatial search ...

AI Technical Summary

Problems solved by technology

However, in the existing R-tree that implements the spatial index structure, the spatial regions corresponding to its sibling nodes may overlap, and the spatial index may need to search multiple paths before obtaining the final spatial object search result. For example, when searching and giving When all spatial objects intersected by a given query area, the space search algorithm of the R tree starts from the root node and searches down the corresponding subtree. The algorithm recursively traverses all subtrees intersected by the constraint area and the query area. When , the elements in the bounding rectangle are taken out and tested to see if they intersect with the query area, and all the leaf nodes intersecting with the query area are the spatial objects to be searched. Therefore, the query efficiency of the R-tree will decrease due to the increase of the overlapping area. Greatly weakened, and the time complexity will even degenerate from logarithmic search to linear search, and the algorithm structure of R tree is relatively complex, which affects the user's spatial object search experience

Images