Abstract: To store geometric objects, a distance is determined from each prespecified objects to one other prespecified object. The distance represents a similarity of the corresponding prespecified objects. The prespecified objects are grouped together such that the prespecified objects are more similar with respect to prespecified geometric objects of the same group than with respect to objects of the other groups. For each group, a representative is ascertained, depending on the prespecified objects within the groups. The representatives of all the groups (are stored. In a representative fashion for the prespecified objects, only one identification of the prespecified object an indication of the corresponding representative of the prespecified object and values, by which a size and position of the corresponding representative is prespecified, is stored for each of the prespecified objects, depending on the size and the position of the corresponding prespecified objects.

Abstract: The aim of the invention is to determine the minimum costs (MIN KOST) from a starting location (STO) to a destination (ZIO), in order to plan a route from said starting location (STO) to the destination (ZIO). To achieve this, a starting node (STK) is determined in accordance with the starting location (STO). Corresponding starting node costs (STK_KOST) to starting map markers (LM_ST) are determined in accordance with the starting nodes (STK). A destination node (ZIK) is determined in accordance with the destination (ZIO). The destination node costs (ZIK_KOST) to destination map markers (LM_ZI) are determined in accordance with the destination nodes (ZIK). In addition, map marker costs (LM_KOST) from each starting map marker (LM_ST) to each destination map marker (LM_ZI) are determined with the aid of a table, which comprises the map marker costs (LM_KOST) of all map markers to all other map markers.

Abstract: A database system includes a database management system and a database. The database comprises at least one file to be updated (OLD_FILE) which is stored on a storage device. To update the database, the file to be updated (OLD_FILE) is deleted. A new file (NEW_FILE) from the database with current data is transferred to the storage device using a transfer command (SQL_COPY) which is authored in a database language of the database system.

Abstract: The aim of the invention is to determine the minimum costs (MIN_KOST) from a starting location (STO) to a destination (ZIO), in order to plan a route on a map (MAP). To achieve this, starting nodes (STK) are determined in accordance with the starting location (STO). Different categories of starting node costs (STK_KOST) from the starting nodes (STK) to at least one predetermined map marker are assigned to the starting nodes (STK). At least the predetermined map marker(s) and the corresponding starting node costs (STK_KOST) of the different categories are determined in accordance with the starting nodes (STK). Destination nodes (ZIK) are determined in accordance with the destination (ZIO). Different categories of destination node costs (ZIK_KOST) from the destination nodes (ZIK) to at least the predetermined map marker are assigned to the destination nodes.

Abstract: Presented is a navigation system that includes a navigation apparatus, a relational database that stores navigation data as individual data records. Each individual record includes at least one respective data packet that represents a dedicated propriety database, at least one respective property of the relevant data packet, and a respective unique identifier of each of the individual data records. The navigation system further includes a database management system that is configured to access the navigation data stored in the relational database. Also presented is a method for operating the navigation system that includes using the database management system to access the navigation data in the relational database in response to an instruction from the navigation apparatus, and using, by the navigation apparatus, at least one prescribed access function to access data in the data packet that represents the dedicated propriety database.