Abstract: It is disclosed to determine, in a second process of compiling data that yields a second compiled database, whether a first compiled database, which is yield from a first process of compiling data performed before the second process of compiling data, contains first object data defining a first object that is considered at least similar to a second object; and to include, in the second process of compiling data, second object data defining the second object into the second compiled database, if it is determined that first object data defining a first object that is considered at least similar to the second object is not contained in the first compiled database, and including the first object data defining the first object into the second compiled database otherwise. Further disclosed are corresponding apparatuses, a corresponding system and a corresponding computer program code.

Abstract: It is disclosed to determine, in a second process of compiling data that yields a second compiled database, whether a first compiled database, which is yield from a first process of compiling data performed before the second process of compiling data, contains first object data defining a first object that is considered at least similar to a second object; and to include, in the second process of compiling data, second object data defining the second object into the second compiled database, if it is determined that first object data defining a first object that is considered at least similar to the second object is not contained in the first compiled database, and including the first object data defining the first object into the second compiled database otherwise. Further disclosed are corresponding apparatuses, a corresponding system and a corresponding computer program code.

Abstract: A method for generating a next valid character tree may comprise:—providing a first name, the first name comprising a first character represented by a first character code,—providing a second name, the second name comprising a second character represented by a second character code, wherein the first character and the second character are homoglyphs with respect to each other, and—generating a next valid character tree according to the names such that the next valid character tree comprises a combined node, which is a place holder for the first character and for the second character.

Abstract: An approach is provided for incremental database updates based on delta pages. An update platform determines at least one new page of a first database and at least one reference page of a second database. The update platform then processes and/or facilitates a processing of the at least one new page and the at least one reference page to determine at least one difference patch comprising one or more differences between the at least one new page and the at least one reference page. In one embodiment, the at least one new page can be constructed from the at least one reference page and the at least one difference patch.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route. Navigation systems can also use the relation to service skyline queries and responsively generate skyline graphs of points of interest.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route.

Abstract: An approach is provided for incremental database updates based on delta pages. An update platform determines at least one new page of a first database and at least one reference page of a second database. The update platform then processes and/or facilitates a processing of the at least one new page and the at least one reference page to determine at least one difference patch comprising one or more differences between the at least one new page and the at least one reference page. In one embodiment, the at least one new page can be constructed from the at least one reference page and the at least one difference patch.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route. Navigation systems can also use the relation to service skyline queries and responsively generate skyline graphs of points of interest.

Abstract: A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route.