Nearest neighbor quick search method and system for ten-million-level point-like elements

A point-like feature and proximity search technology, applied in database indexing, structured data retrieval, digital data information retrieval, etc., can solve problems such as not providing large-scale data parallel processing strategies

Active Publication Date: 2020-08-14
CHINESE ACAD OF SURVEYING & MAPPING
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007](2) No parallel processing strategy for large-scale data
The existing neighborhood search methods have not comprehensively considered how to quickly build an easy-to-parallel index on the basis of ultra-large-scale data, so as to effectively connect algorithms and high-performance computing facilities

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Nearest neighbor quick search method and system for ten-million-level point-like elements
  • Nearest neighbor quick search method and system for ten-million-level point-like elements
  • Nearest neighbor quick search method and system for ten-million-level point-like elements

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0057] In order to make the purpose, technical solution and advantages of the application more clear, the technical solution in the embodiment of the application will be described in more detail below in conjunction with the drawings in the embodiment of the application.

[0058] The following is an embodiment of a fast neighborhood search method for tens of millions of scale point feature data, such as figure 1 As shown, the concrete five core steps that this inventive method comprises are as follows:

[0059] Step 1. Traversing all the point-like feature data to obtain the four-to range (Xmin, Ymin, Xmax, Ymax), starting coordinates (Xo, Yo) and quantity. If the dataset itself has stored four-range and attribute table attributes, you can directly obtain relevant information. The so-called traversal (Traversal) refers to making a visit to each node in the tree (or graph) in turn along a certain search route. The operation done by accessing the node depends on the specific a...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a nearest neighbor quick search method and system for ten-million-level point-like elements. The method comprises the following steps of 1, traversing all point-like elements to obtain a range from four to four, and calculating coordinates and the number of the point-like elements; 2, creating a grid layer according to the data obtained in the step 1, wherein the grid layercomprises at least one grid unit; 3, constructing a task based on the latest grid unit according to the application request; 4, if the point-like elements are changed, carrying out dynamic updating,wherein the updating is to add, delete and move the point-like elements in the grid layer; 5, completing task calculation and result combination, submitting a result to the service request end, and responding to the service request. A series of key technologies and system implementation schemes are provided for solving the problem of rapid neighborhood search of high-density point-like elements ina large-range scene.

Description

technical field [0001] The present application relates to the technical field of a nearest neighbor rapid search method and system for point elements, in particular to a nearest neighbor rapid search method and system for tens of millions of point elements. Background technique [0002] Nearest neighbor search is a basic method widely used in spatial planning and daily life scenarios. In geographic information application services, one of the most common requirements is to find a point of interest (POI, each POI contains four aspects of information, name, category, coordinates, classification) as the center to find the location within a certain radius. Other spatial objects, or the K nearest other spatial objects centered on this location. In real-life scenarios, POIs may be buildings, shops, attractions, etc. Searching through POIs can meet the needs of finding restaurants, attractions, and toilets. As the scale of data collection continues to refine, the content that can...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/22G06F16/29G06F16/9537
CPCG06F16/9537G06F16/29G06F16/2228Y02D10/00
Inventor 亢晓琛刘纪平董春杨毅张用川孙立坚
Owner CHINESE ACAD OF SURVEYING & MAPPING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap