Shared Search Subtree for Navigation Device Input Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Navigation devices face significant storage space requirements due to the need for multiple next valid character (NVC) trees, which are exacerbated by additional functionalities like travel guides that require real-time validation of input names, leading to inefficiencies in data retrieval and storage.
Innovation Solution
The method generates search trees by identifying and sharing a common search sub-tree among multiple NVC trees, reducing redundancy by having nodes in different trees reference the same sub-tree, thereby storing identical portions only once and allowing efficient data retrieval without substantial delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple separate NVC trees are stored for different name validation purposes, then name validation coverage is improved, but storage space requirements increase
Solution Approach 1:
The patent merges multiple NVC trees by identifying common subtrees that can be shared across different name validation contexts. Instead of storing separate complete trees for each validation purpose, the invention combines them by having multiple root nodes reference shared subtree structures, thereby reducing redundant storage while maintaining comprehensive name validation coverage.
Solution Approach 2:
The patent creates universal subtrees that can serve multiple validation functions simultaneously. A single subtree structure can be referenced by multiple root nodes for different name types (e.g., city names, street names, POI names), allowing the same data structure to perform multiple validation roles and eliminating the need for separate dedicated trees for each function.
2Reliability
If complete NVC trees are stored for all possible names, then validation accuracy is improved, but data retrieval time increases
Solution Approach 1:
The patent segments the NVC tree structure into root nodes and shared subtrees. This segmentation allows the system to store complete validation data across the distributed structure while enabling faster retrieval by having multiple entry points (root nodes) that can directly access relevant subtrees without traversing entire tree structures.
Solution Approach 2:
The patent performs preliminary organization of validation data into reusable subtree structures that can be quickly attached to different root nodes. This preliminary structuring ensures that validation data is pre-organized in an optimal format, allowing rapid retrieval when validation is needed without performing complex operations at query time.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
A method of generating search trees (25, 27) indicating next valid characters for an input interface of a navigation device includes determining a search sub-tree (29) which indicates next valid characters for both a subset of a first set of character strings and for a different second set of character strings. A first search tree (25) is generated based on information on the first set of character strings, and a second search tree (27) is generated based on information on the second set of character strings. The first search tree (25) is generated such that a node (26) of the first search tree (25) references the search sub-tree (29). The second search tree (27) is generated such that another node (28) of the second search tree (27) references the search sub-tree (29).