Nearest search on adaptive index with variable compression
A technology that is closest to the search tree, applied in special data processing applications, instruments, calculations, etc., can solve problems such as difficult to find objects quickly
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0013] One embodiment of the invention is a computer-implemented method that involves searching the nodes of the tree 102 for a search system that is closest to an object. The tree may be constructed for a set of objects, each having a spatial coordinate key, such that nodes in the tree correspond to bounding boxes defining subgroups of these objects. Search finds the closest objects to a location.
[0014] In one embodiment, the bounding box of the tree nodes below the root only covers the area in which the object exists. This optimizes storage of objects and retrieval of potentially closest objects. Similarly, in one embodiment, the bounding box of a child node only covers the area in which the object exists. The bounding box of the root node may be such that it excludes certain areas that do not have related objects.
[0015] In one embodiment, latitude and longitude coordinates may be used. For example, numbers for latitude and longitude coordinates may be interleaved ...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com