Updating method for databases, in particular navigation databases

• US 9,378,222 B2
• Filed: 07/06/2007
• Issued: 06/28/2016
• Est. Priority Date: 07/25/2006
• Status: Active Grant

• Current Assignee: DENSO Corporation, Robert Bosch GmbH
• Original Assignee: Robert Bosch GmbH
• Inventors: Luedtke, Dirk, Starke, Alexander
• Primary Examiner(s): GEBRESENBET, DINKU W
• Application Number:
  US12/309,617
• Publication Number:
  US 20100076928A1
• Time in Patent Office: 3,280 Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/3878 Hierarchical structures, e.g. layering
• CPC Class Codes: G06F 16/29 Geographical information databases

Abstract

A method for updating a decentralized database, in particular a navigation database, that is subdivided into segments, by transmitting an updated segment from a central database subdivided into corresponding segments to the decentralized database, and by storing the updated segment in the decentralized database avoids inconsistencies in an only stepwise update in that the segments are modeled to a hierarchical model in the decentralized database, and in the updating of the segment the particular segments from which the segment depends are updated as well.

Claims

1. A method for updating a decentralized database for navigation that is divided into segments, the method comprising:

transmitting an updated segment from a central database, subdivided into corresponding segments, to the decentralized database;

storing the updated segment in the decentralized database;

wherein the segments are modeled to a hierarchical model in the decentralized database,

wherein in the updating of the segment, updating particular segments from which the segment depends, and

wherein versioned nodes are determined in the decentralized database, and each segment is formed from one versioned node and all subordinate nodes which are not versioned nodes.

2. The method of claim 1, wherein the hierarchical model has a tree structure.

3. The method of claim 1, wherein each of the segments is assigned a version.

4. The method of claim 3, wherein the version is represented by a whole number.

5. The method of claim 1, wherein the version is stored in one of an associated segment and a central data structure of the decentralized database.

6. The method of claim 1, wherein for each new version of a segment, a check is performed within a data center as to which versions of other segments are consistent with the new version.