Navigation Database Routing Clusters for Memory Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation databases, such as those compliant with the Navigation Data Standard (NDS), face inefficiencies in addressing navigation data due to their rigid global tiling scheme, which requires memory-consuming IDs and does not adapt well to varying route link densities across different geographic areas.
Innovation Solution
The proposed method structures navigation databases using index structures for routing clusters, allowing for flexible partitioning of geographic areas into tiles with variable numbers of clusters based on route link density, independent of the tile structure, and employs cluster identifiers and link identifiers to efficiently organize and access route links.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a global tiling scheme is used for navigation data addressing, then the data structure is standardized and compatible with NDS, but memory consumption increases due to memory-consuming IDs and rigid structure
Solution Approach 1:
The patent divides the navigation database into routing clusters that are organized independently from the tile structure. Each routing cluster contains route links that are grouped by spatial proximity and routing relevance, allowing the system to segment the data into manageable units that can be addressed with smaller identifiers rather than requiring full global tile identifiers for every route link.
Solution Approach 2:
The patent implements local quality by creating routing clusters with variable characteristics based on local route link density and routing patterns. Different regions of the database can have different cluster configurations optimized for their specific characteristics, rather than applying a uniform global tiling approach throughout the entire database.
2Stability of the object's composition
If a rigid global tiling scheme is used, then the addressing structure is consistent, but adaptability to varying route link densities across different geographic areas deteriorates
Solution Approach 1:
The patent introduces dynamics by allowing the routing cluster structure to adapt to varying route link densities across different geographic areas. The system can dynamically adjust the number and size of routing clusters based on the actual distribution of route links, rather than being constrained by a fixed global tiling scheme. This enables the database to efficiently handle both densely populated urban areas and sparsely populated rural regions.
3Ease of manufacture
If route links are organized in fixed tile blocks, then the data organization is simple, but the complexity of database reorganization increases when updates are needed
Solution Approach 1:
The patent segments the navigation database into routing clusters that are logically organized but physically independent from the tile structure. This segmentation allows updates to be applied to individual routing clusters without requiring reorganization of entire tile blocks, significantly reducing the complexity of database maintenance and updates while preserving simple data organization within each cluster.
4Reliability
If memory-consuming IDs are used for addressing route links, then all route links can be uniquely identified, but the efficiency of navigation data addressing deteriorates
Solution Approach 1:
The patent segments the identification system into two parts: routing cluster identifiers that locate the general area, and local route link identifiers that identify specific links within clusters. This hierarchical segmentation reduces the overall identifier size and improves addressing efficiency while maintaining the ability to uniquely identify all route links in the database.
Data Source
Figure 1a~1c
Figure 2a~2b
Figure 3
AI summary
A technique of structuring a navigation database is provided, wherein the navigation database comprises at least route link data for a predetermined geographic area. A method implementation of the technique comprises the steps of organizing route link data associated with the predetermined geographic area into at least one routing cluster; providing the at least one routing cluster with a cluster identifier; and storing the at least one routing cluster together with the cluster identifier in the navigation database.