Abstract: A method and system for efficiently storing, retrieving, and updating binary large objects (BLOBs) in embedded systems is disclosed. The metadata of the BLOBs is stored in relational tables, while the BLOBs are stored in a flat file. Querying the metadata of the BLOBs (i.e. the starting points of the BLOBs and their length) is performed based on SQL. The corresponding BLOBs are then accessed using file operation commands. To further simplify the querying and storage of BLOBs, virtual tables are created. By using these virtual tables, a user can access a BLOB as if it was stored in a physical table.

Abstract: An infotainment system including a relational database stored on a memory medium, and a database management system. The database management system is designed to access infotainment data stored in the relational database as data records. A data record includes a clear characteristic of the data record and at least one table property. At least the clear characteristic of the respective data record is stored in a property value table in the relational database. The property value table represents a corresponding value of the table property of the respective data record.

Abstract: A method and system for accessing database tables that contain binary large objects (BLOBs) is disclosed. The method includes encapsulating BLOB-based tables with virtual tables, which allows a user to access the content of the BLOBs via SQL. In one example, the virtual table has a generic table structure that consists of columns (e.g., class name, field name, and field value) and information regarding what level of an object hierarchy contains an element. In another example, a user can define the structure of the virtual table by identifying which object attributes to report.

Abstract: A method and system for full text search for use during destination selection with a navigation system is disclosed. The method partitions a full text search index based on frequently used terms. These frequently used terms are then mapped to dedicated full text search indexes, where each document contains this frequently used term but the term itself is not stored in the index. A relation maps the frequently used terms to the inverted indexes.

Abstract: A method and system for full text search during destination selection using a navigation system is disclosed. The full text search system includes a relation table and a spatial index structure, e.g., an R-tree. The relation table maps tokens to a token identifier. Each level of a destination is mapped to its own dimension, e.g., Country to X, City to Y, and Street to Z. Each document is then mapped to an n-dimensional vector using the token identifiers.

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: In order to store prespecified geometric objects on a storage medium (20), a distance (DIST) is determined from each of the prespecified geometric objects to at least one other of the prespecified geometric objects. The distance (DIST) is representative of a similarity of the corresponding prespecified geometric objects. The prespecified geometric objects are grouped together, depending on the distances (DIST) of the prespecified geometric objects from one another, into groups (GRP) such that the prespecified geometric objects are more similar with respect to prespecified geometric objects of the same group (GRP) than with respect to prespecified geometric objects of the other groups (GRP).

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.