18150950. FAST AND ACCURATE GEOMAPPING simplified abstract (International Business Machines Corporation)

From WikiPatents
Jump to navigation Jump to search

FAST AND ACCURATE GEOMAPPING

Organization Name

International Business Machines Corporation

Inventor(s)

Dakshi Agrawal of Monsey NY (US)

Raghu K. Ganti of Elmsford NY (US)

Mudhakar Srivatsa of White Plains NY (US)

Petros Zerfos of New York NY (US)

FAST AND ACCURATE GEOMAPPING - A simplified explanation of the abstract

This abstract first appeared for US patent application 18150950 titled 'FAST AND ACCURATE GEOMAPPING

Simplified Explanation

The patent application describes a system and method for finding the k-nearest-neighbors to a given point within a certain distance. Here are the key points:

  • The method involves creating an index of geometries using geohashes as an indexing key.
  • A geohash representation of the given point is calculated with a resolution equal to the distance value.
  • The method searches for the closest-prefix geometry from the indexed set using the geohash representation of the given point.
  • Geometries with the same prefix as the closest-prefix geometry are identified from the indexed set.
  • Distances between the given point and the identified geometries are calculated.
  • The method determines the k geometries with the shortest distances less than the given distance.

Potential applications of this technology:

  • Location-based services: This method can be used to find nearby points of interest, such as restaurants, hotels, or gas stations.
  • Geospatial analysis: It can be used to analyze spatial data and find the nearest neighbors for various purposes, such as market analysis or urban planning.
  • Routing and navigation: The method can help in finding the nearest points or routes for navigation purposes, such as finding the closest gas station along a route.

Problems solved by this technology:

  • Efficient search: The method provides a way to efficiently search for the k-nearest-neighbors within a given distance, which can be computationally expensive for large datasets.
  • Scalability: By using geohashes as an indexing key, the method allows for scalable indexing and retrieval of geometries.
  • Precision control: The resolution of the geohash representation can be adjusted to control the level of precision in finding the nearest neighbors.

Benefits of this technology:

  • Faster search: The method's indexing and search techniques enable faster retrieval of the k-nearest-neighbors, improving overall performance.
  • Scalability: The use of geohashes allows for efficient indexing and retrieval of geometries, making the method scalable for large datasets.
  • Flexibility: The method allows for adjusting the resolution of the geohash representation, providing flexibility in controlling the precision of the search results.


Original Abstract Submitted

A system and method are provided for discovering k-nearest-neighbors to a given point within a certain distance d. The method includes constructing an index of geometries using geohashes of geometries as an indexing key to obtain an indexed set of geometries, and calculating a geohash representation of the given point with a resolution equal to a magnitude value of d. The method includes searching for a closest-prefix geometry from the indexed set using the geohash representation of the given point, and identifying geometries from the indexed set having a same prefix as the closest-prefix geometry. The method further includes calculating distances between the given point and the geometries identified from the indexed set having the same prefix as the closest-prefix geometry, and determining k geometries with respective shortest distances less than d from the geometries identified from the indexed set having the same prefix as the closest-prefix geometry.