Map Database Update via Hierarchical Node Digests
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Outdated map data on client devices can lead to unsafe and inefficient navigation, causing potential catastrophic events due to incorrect interpretation of road signs and routes that no longer exist.
Innovation Solution
A method and apparatus for updating map databases using a cloud-based backend system, where client devices retrieve and synchronize updated map data through a hierarchical tree structure, comparing node digests and recomputing the tree structure as needed, to ensure accurate and efficient navigation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If map data is stored locally in client devices, then navigation can be performed offline, but the map data becomes outdated over time
Solution Approach 1:
The system performs preliminary actions by establishing hierarchical tree structures and computing node digests in advance. When updates are needed, the client device sends only the root node digest to the server, which pre-computes and returns only the necessary updated portions of the tree, rather than transmitting entire map datasets.
Solution Approach 2:
The patent segments map data into hierarchical tree structures with nodes representing different levels of geographic detail. Each node contains a digest value, allowing the system to identify and update only specific segments (nodes) that have changed, rather than updating the entire map database.
2Reliability
If complete map updates are transmitted to client devices, then map data freshness is improved, but bandwidth consumption increases
Solution Approach 1:
The system extracts only the essential information needed for update verification - specifically, the root node digest - and transmits minimal data between server and client. The hierarchical tree structure allows extraction of only changed portions rather than transmitting complete map datasets.
Solution Approach 2:
Node digests are computed in advance and stored on both server and client sides. This preliminary computation eliminates the need for transmitting large amounts of raw map data, as the pre-computed digests enable efficient update detection and retrieval of only necessary changes.
3Reliability
If frequent map updates are performed, then navigation reliability is improved, but storage requirements increase
Solution Approach 1:
Map data is segmented into hierarchical tree structures where only specific nodes need to be updated. This segmentation allows the system to maintain navigation reliability by updating only changed portions rather than storing complete updated datasets, reducing overall storage requirements.
Solution Approach 2:
The system discards outdated map data and recovers only the necessary updated portions through incremental updates. By maintaining hierarchical tree structures with digest values, the system can identify what needs to be kept and what can be discarded, optimizing storage efficiency.
Data Source
AI summary
An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises determining an update candidate node, wherein the update candidate node is associated with a node identifier and a first node digest; sending the node identifier and the first node digest to an update data service; and receiving, from the update data service, a response containing one of node digests of the child nodes of the update candidate node at the update data service; or updated content corresponding to the update candidate node. The method may further include updating the map database based on the received response.