Abstract: Retrieving data records from a database is provided. A query is received by a database access API requesting a number of data records stored in the database. A parallel batch processor is created for data transmittal, and the parallel batch processor is returned to a client program. A next data record responsive to the query is requested, and the next data record is removed from a list of records. The next data record is then provided from the parallel batch processor to the client program.

Abstract: Performing a distributed database transaction using parallel writes to a distributed append-only database system is provided. A central database and a plurality of distributed databases, also known as “shards”, may be used. A request made to implement a distributed transaction, requiring updates to one or more shards, results in a monotonically increasing identification (ID) number being assigned to a change set. The request and change set may be registered at the central database. Once the change set is completely written to all of the appropriate shards, the change set is marked as completed in the central database. After write completion, a change set ID boundary at the central database is advanced to indicate the current fully changed status of the distributed database.

Abstract: Improving the efficiency of distributed database systems in providing geographically related information is provided by generating a data object identifier (ID) in association with geographical data. A geographical data object is received for storage in the distributed database system. A grid ID is generated based on spatial information contained in the geographical data object, a shardlet ID is generated indicating a shardlet location in a given shard on which the geographical data object is stored, and a sequence ID is generated indicating data placement within the shardlet location. The data object ID is assigned to the geographical data object, the data object ID comprising the grid ID, the shardlet ID, and the sequence ID.

Abstract: Retrieving data records from a database is provided. A query is received by a database access API requesting a number of data records stored in the database. A parallel batch processor is created for data transmittal, and the parallel batch processor is returned to a client program. A next data record responsive to the query is requested, and the next data record is removed from a list of records. The next data record is then provided from the parallel batch processor to the client program.

Abstract: Improving the efficiency of distributed database systems in providing geographically related information is provided by generating a data object identifier (ID) in association with geographical data. A geographical data object is received for storage in the distributed database system. A grid ID is generated based on spatial information contained in the geographical data object, a shardlet ID is generated indicating a shardlet location in a given shard on which the geographical data object is stored, and a sequence ID is generated indicating data placement within the shardlet location. The data object ID is assigned to the geographical data object, the data object ID comprising the grid ID, the shardlet ID, and the sequence ID.

Abstract: Performing a distributed database transaction using parallel writes to a distributed append-only database system is provided. A central database and a plurality of distributed databases, also known as “shards”, may be used. A request made to implement a distributed transaction, requiring updates to one or more shards, results in a monotonically increasing identification (ID) number being assigned to a change set. The request and change set may be registered at the central database. Once the change set is completely written to all of the appropriate shards, the change set is marked as completed in the central database. After write completion, a change set ID boundary at the central database is advanced to indicate the current fully changed status of the distributed database.

Abstract: A route between start and destination locations is generated, and a navigation device presents navigation instructions to a user describing the route. The navigation instructions can be colloquial navigation instructions, which are instructions that are more humanized (e.g., more conversational in language and format, or consistent with the manner in which people typically talk to one another in familiar or informal conversation). The route that is generated can be based on one or more user-favored routes. A user-favored route is a route between two locations that is determined to be desired, preferred, or otherwise favored by a user over other routes. The route that is generated can be generated to include at least part of one or more user-favored routes.

Abstract: A familiarity that a user of a navigation device has with each of multiple geographic areas is determined. A route to a destination is identified and navigation instructions are provided to the user as he or she travels along the route. The instructions provided to the user along the route are generated based on the familiarity of the user with one or more geographic areas along the route. This generation of instructions can include delaying the start of providing instructions to the user, adapting the level of guidance provided to the user, adapting the aggressiveness of route recalculation, combinations thereof, and so forth.

Abstract: A computer system and media for delivering routing information are provided. The computer system includes a routing engine, a database, and routing network that are employed to respond to routing requests and user modifications of routing information received in response to the routing requests. The routing engine receives the routing requests and generates routing information that illustrates a route and metadata for directions that guides a user when navigating the route. A user that is dissatisfied with the routing information may use route modification tools to alter the route in a manner that is consistent with the user's understanding of alternate routes that may supplement the routing information provided by the routing engine. The computer system receives the user modifications, stores the user modifications, and updates the routing network to learn the alternate route provided in the user modifications.

Abstract: A routing system for efficiently determining a route between an origin and destination is provided. The routing system operates on route data that is organized into rectangular grids. The route data includes edges with their costs, and nodes that identify connecting edges. The route data is also organized according to a hierarchy, with higher level grids corresponding to at least one lower level grid. The lowest level grids contain all route data corresponding to the area covered by each low level grid. The higher level grids contain a copy of route data from their corresponding lower level grids for only those routes that are identified as important routes. A routing algorithm uses the hierarchy in a manner such that higher level grids are used whenever practical to efficiently find a route from the origin to the destination.

Abstract: A navigation system and method for resolving discrepancies between a reported position and route data is presented. Based on a reported position, the navigation system identifies prospective road segments within a radius of the reported position. For each road segment, the navigation system generates a series of scores according to various attributes, including the current heading, current speed, proximity of reported location to the prospective road, and the like. Historical scores are also generated based on historical information, i.e., previous navigation device locations. Scores are normalized such that they can be compared, and optionally weighted according to particular implementation details. After scores have been generated for each prospective road, the prospective road, and its determined location, with the best score is selected as the resolved, actual location.

Abstract: A computer system and media for delivering routing information are provided. The computer system includes a routing engine, a database, and routing network that are employed to respond to routing requests and user modifications of routing information received in response to the routing requests. The routing engine receives the routing requests and generates routing information that illustrates a route and metadata for directions that guides a user when navigating the route. A user that is dissatisfied with the routing information may use route modification tools to alter the route in a manner that is consistent with the user's understanding of alternate routes that may supplement the routing information provided by the routing engine. The computer system receives the user modifications, stores the user modifications, and updates the routing network to learn the alternate route provided in the user modifications.

Abstract: A method and system for generating driving directions composes computer-based instructions that emulate a human driving perspective. Language-based instructions guide a driver along a route that encompasses a sequence of roads and intersections. An algorithm applies rules based on human perception to route components. The algorithm diagnoses road name changes so that instructions are clear and concise. The algorithm analyzes road and intersection geometry at confusing areas, such as road forks, roundabouts, ferry crossings, cloverleaf interchanges, and ramps, to generate instructions that conform to a driver's natural perspective. The algorithm analyzes the configuration of an intersection with respect to a driver's field of view to compose a clear and concise instruction. When appropriate, the algorithm produces compound instructions for adjacent intersections.