Navigation System Database Segmentation for Fast Destination Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation systems face inefficiencies due to complex database structures, leading to long search times and high memory requirements, making it challenging to quickly find navigation destinations in motor vehicles.
Innovation Solution
A method utilizing two separate databases, one for geographical regions and another for street names and points of interest, with references linking them, allowing for a linear search and reducing the complexity of the search process, thereby minimizing time and memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single complex database is used to store all navigation data, then comprehensive destination information is available, but search time and memory requirements increase significantly
Solution Approach 1:
The patent divides the navigation database into two separate databases: a first database storing geographical region data and a second database storing street name and point of interest data. This segmentation allows independent optimization of each database structure and enables more efficient search operations by reducing the search space in each database compared to a single monolithic database.
Solution Approach 2:
The patent introduces reference data structures that link the first and second databases. These references act as intermediaries that enable efficient joining of results from both databases without requiring a full Cartesian product search, thus reducing search time while maintaining comprehensive destination information.
2Reliability
If a single complex database is used to store all navigation data, then complete navigation information is stored, but RAM memory requirements increase
Solution Approach 1:
By segmenting the database into two separate structures, the patent enables more efficient memory utilization. Each database can be optimized for its specific data type, and the reference-based joining mechanism reduces the need to load entire datasets into RAM simultaneously, thereby reducing overall memory requirements while maintaining complete navigation information.
3Stability of the object's composition
If hierarchical destination input is used, then database structure is maintained, but user input effort increases
Solution Approach 1:
The patent implements a search mechanism that automatically performs full-text searches across both databases using user input. The system self-services by handling the complex database joining and reference resolution operations without requiring users to manually navigate hierarchical structures, thus reducing user input effort while maintaining database structural integrity.
4Ease of operation
If full-text search is implemented in a large database, then user-friendly single input search is enabled, but computational effort increases
Solution Approach 1:
The patent reduces computational effort by segmenting the full-text search operation into two separate searches across smaller, specialized databases. This segmentation decreases the search space and index size for each database, making full-text search more computationally efficient while maintaining user-friendly single-input search functionality.
Solution Approach 2:
The reference data structures serve as intermediaries that enable efficient combination of search results from both databases. Instead of performing a single complex full-text search across all data, the system performs two simpler searches and joins results through references, reducing overall computational effort while maintaining ease of operation.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to a method for operating a navigation system (11) of a motor vehicle (1) for searching for possible destinations, wherein a computation device (12) of the navigation system (11) is used: to receive (S1) a search input from a user, to search (S2) a first database (16) and a second database (17) for suitable database entries (18) in each case on the basis of the search input and in this case to provide (S3) a first and a second results list of suitable database entries (18), wherein the first database (16) stores database entries (18) that indicate geographical regions, and the second database (17) stores database entries (19) that indicate road names and/or special destinations, and wherein for each road name and/or special destination the second database (17) indicates a reference to at least one geographical region, and to determine (S7) entry pairs that each contain a database entry (18) from the first results list and a database entry (19) from the second results list as the possible destinations.