Location Query Indexing for Fast Region-of-Interest Detection

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing location query systems are inefficient in determining whether a target entity is within a region of interest, as they lack an effective mechanism to quickly and accurately identify the region corresponding to a given geographic location point and perform actions based on that identification.

Innovation Solution

The system employs a processor to generate an index system by dividing polygons associated with regions of interest into sub-polygons, each with a unique code, using a hierarchical encoding scheme like geohash codes, to efficiently determine if a location is within the region, and provides a mechanism for real-time query responses.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If traditional location query methods are used to determine whether a device is within a region of interest, then the system can provide location-based services, but the query processing is slow and inefficient

Engineering Contradiction:

Improvequery processing speedVSAvoidtime to determine location within region

Core Design Contradiction:

SpeedVSLoss of time

Solution Approach 1:

The patent divides the region of interest into multiple sub-regions or grid cells, each with a unique identifier. This segmentation allows the system to quickly determine which sub-region a device is in by comparing its location against pre-computed index structures, rather than performing complex geometric calculations for the entire region. This directly improves query processing speed and reduces time loss.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The system performs preliminary actions by pre-computing and storing index structures that map region boundaries to sub-region identifiers. These indexes are built in advance and stored for rapid lookup during query processing. This eliminates the need for real-time geometric computations, significantly reducing query response time.

Inventive Principle:

Principle #10Preliminary action

2Productivity

If the system divides polygons into sub-polygons with unique codes to enable rapid location queries, then query processing efficiency improves, but the system complexity increases

Engineering Contradiction:

Improvequeries processed per secondVSAvoidcomplexity of index generation and query mechanism

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent transforms the continuous geographic space into a discrete grid structure where each sub-region is identified by unique codes (e.g., geohash codes). This parameter change from continuous coordinates to discrete identifiers simplifies the query operation to a simple code comparison, dramatically increasing productivity while managing complexity through standardization.

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The system creates simplified copies or representations of the geographic regions in the form of index structures and hash codes. Instead of working with complex polygon geometries during queries, the system uses pre-computed code representations that capture the essential spatial relationships, enabling fast processing without sacrificing accuracy.

Inventive Principle:

Principle #26Copying

3Measurement precision

If the system uses hierarchical encoding schemes like geohash codes to represent locations, then location identification accuracy improves, but the computational overhead for encoding and decoding increases

Engineering Contradiction:

Improveprecision of location identificationVSAvoidcomputational energy for encoding operations

Core Design Contradiction:

Measurement precisionVSUse of energy by moving object

Solution Approach 1:

The system pre-computes and stores the hierarchical code representations for all sub-regions during index generation. When a device queries its location, the system compares the device's pre-computed location code against the stored index codes, avoiding repeated encoding/decoding operations. This preliminary action reduces real-time computational energy requirements while maintaining high precision.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent replaces complex geometric calculations and coordinate transformations with simple string or numerical code comparisons. The hierarchical encoding scheme allows location matching to be performed through straightforward code prefix matching or equality checks, substituting computationally intensive geometric operations with much lighter computational tasks that consume less energy.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS11461289B2Apparatus, systems, and methods for providing location information

Publication Date: 2022.10.04 FOURSQUARE LABS INC

AI summary

The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., Jesse Hate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.