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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com