Spatial Hierarchy Identifiers for Scalable Location Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing spatial data indexing techniques, such as R-trees and quad-trees, face performance degradation as data sets grow, leading to inefficiencies in search rates and manageability when handling large amounts of spatial data across multiple devices and web browsers.
Innovation Solution
A method for generating spatial hierarchy identifiers independently of a data set, allowing for efficient association of content with locations and areas, and distributing computing resources across a spatial hierarchy to improve search performance and reduce bottlenecks, using recursive subdivision of space and mapping resources to sections of the hierarchy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If R-trees or quad-trees are used for spatial indexing, then spatial data can be organized and searched, but search performance degrades dramatically as the data set grows
Solution Approach 1:
The patent divides the spatial index into multiple independent hash tables, each responsible for a specific region or aspect of spatial data. This segmentation allows parallel processing and prevents the performance degradation that occurs in traditional single-structure spatial indexes when data sets grow large.
Solution Approach 2:
The patent creates multiple copies of spatial data organized in different hash tables with different indexing strategies. By maintaining redundant copies organized differently, the system can query multiple copies simultaneously and return results without being bottlenecked by a single index structure's performance limitations.
2Stability of the object's composition
If R-trees are used to fit data topology, then spatial relationships are preserved, but the structure becomes complex and difficult to implement
Solution Approach 1:
The patent replaces the complex mechanical tree-based spatial indexing system with a hash table-based system. Instead of using recursive tree structures with complex splitting and merging operations, the system uses hash functions to directly map spatial coordinates to table entries, dramatically simplifying the implementation while maintaining spatial relationship capabilities.
Solution Approach 2:
The patent changes the fundamental parameter of spatial indexing from tree-based hierarchical organization to hash-based direct addressing. This parameter change transforms the complexity from O(log n) tree operations to O(1) hash operations, while using composite hash keys that encode spatial relationships to preserve topological information.
3Area of stationary object
If quad-trees divide space into tiles, then spatial organization is achieved, but objects crossing tile boundaries create performance problems
Solution Approach 1:
The patent adds an additional dimension to the indexing by using composite hash keys that incorporate multiple spatial coordinates and levels. Instead of being constrained to a single tile boundary system, objects can be indexed across multiple dimensions simultaneously, allowing efficient retrieval regardless of tile boundary crossings.
4Productivity
If spatial data is distributed across multiple computers, then query throughput increases, but coordination overhead and message passing become bottlenecks
Solution Approach 1:
The patent merges the spatial indexing functionality directly into the database storage layer using hash tables, eliminating the need for separate coordination layers. By combining indexing and storage in a unified hash-based structure that can be distributed across computers, the system reduces coordination overhead while maintaining parallel query processing capabilities.
Data Source
AI summary
A program storing computer-readable instructions therein for instructing a computer to perform analytical steps for generating a spatial hierarchy identifier that corresponds to a spatial hierarchy used on a server, the program includes a recording medium readable by the computer; and the computer instructions stored on said recording medium instructing the computer to perform the processes including identifying a position using a position indication system, and generating an identifier within the computer and independent of the server, wherein the identifier identifies first regions within the first spatial hierarchy on the server corresponding to the position.