Geospatial Database Indexing for Faster Large-Scale Query Execution

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing database systems face limitations in processing speed due to hardware constraints, data storage methods, and restricted co-processing options, leading to inefficiencies in handling large volumes of data.

Innovation Solution

A database system architecture that employs parallelized data input, storage, and processing systems, along with optimized query planning and execution, utilizing geospatial indexing to enhance data management and retrieval efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If data is stored in traditional database systems, then data can be stored and retrieved, but processing speed is limited by hardware constraints and storage methods

Engineering Contradiction:

Improveprocessing speedVSAvoidhardware constraints

Core Design Contradiction:

SpeedVSDevice complexity

Solution Approach 1:

The patent divides geospatial data into hierarchical levels (e.g., country, state, county, city, neighborhood) and stores them in segmented structures. This segmentation allows the system to process and retrieve data at different granularities, improving processing speed by only loading necessary levels into memory rather than processing entire datasets.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimensional organization for geospatial data by creating multi-level hierarchical indexes that add spatial and administrative dimensions to traditional database storage. This dimensional transformation enables faster query execution by organizing data along multiple axes (geographic, administrative, hierarchical) rather than single-table structures.

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

2Loss of time

If traditional storage methods are used, then data can be stored, but execution time increases for large volumes of data

Engineering Contradiction:

Improveexecution timeVSAvoiddata volume

Core Design Contradiction:

Loss of timeVSQuantity of substance

Solution Approach 1:

The patent pre-computes and stores hierarchical geospatial indexes before query execution. These pre-built indexes include pre-calculated spatial relationships and administrative boundaries at multiple levels, allowing the system to quickly retrieve and filter data without performing complex computations during query execution, thus reducing execution time for large datasets.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent replaces traditional mechanical database query execution (sequential scanning, index-based searching) with a hierarchical spatial indexing mechanism that uses pre-computed geometric relationships. This substitution enables the system to rapidly filter and retrieve geospatial data by comparing query boundaries against pre-stored hierarchical spatial structures rather than scanning individual records.

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

3Productivity

If co-processing options are restricted, then system simplicity is maintained, but processing efficiency decreases

Engineering Contradiction:

Improveprocessing efficiencyVSAvoidco-processing options

Core Design Contradiction:

ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent creates a universal hierarchical geospatial indexing framework that can handle multiple types of geospatial queries (point-in-polygon, distance calculations, spatial joins, boundary intersections) through a single unified structure. This multi-functional index system improves processing efficiency by providing a versatile foundation that adapts to various query types without requiring separate processing mechanisms.

Inventive Principle:

Principle #6Universality (Multi-functionality)

4Ease of operation

If geospatial data is not optimized for retrieval, then storage is simple, but data management and retrieval efficiency decrease

Engineering Contradiction:

Improveretrieval efficiencyVSAvoiddata storage method

Core Design Contradiction:

Ease of operationVSDevice complexity

Solution Approach 1:

The patent implements a nested hierarchical structure where geospatial data is organized in concentric levels of granularity (countries containing states, states containing counties, etc.). Each level is nested within the previous level, creating a Russian-doll structure that enables efficient retrieval by allowing queries to operate at any hierarchical level while automatically inheriting context from parent levels, thus improving retrieval efficiency without requiring complex cross-referencing.

Inventive Principle:

Principle #7Nested doll (Nesting)

Data Source

PatentUS12554694B2Database system with geospatial data and methods for use therewith

Publication Date: 2026.02.17 OCIENT HOLDINGS LLC

AI summary

A database system operates by: executing a query against a relational database table indicating a predicate applied to geospatial data of a geospatial data column, based on: applying an inner predicate to internal level nodes when traversing a set of internal levels of the each tree-based index structure to identify a first subset of leaf nodes in a plurality of leaf nodes of the each tree-based index structure based on identifying internal nodes having internal node bounding boxes meeting the inner predicate; and applying a leaf predicate to only leaf nodes included in the first subset of leaf nodes of the tree-based index structure to identify a second subset of leaf nodes of the first subset of leaf nodes corresponding to only leaf nodes of the first subset of leaf nodes having corresponding leaf node bounding boxes meeting the leaf predicate; wherein a query resultant of the query is generated based on geospatial objects of the geospatial data column for ones of a plurality of rows of the relational database table indicated by the second subset of leaf nodes.