Abstract: A distributed processing system for providing location based services is provided along with a system, method and computer program product for customizing services, such as location based services to be provided onboard a vehicle. The distributed processing system includes a plurality of computing devices including at least one edge device and at least one cloud computing device. Each computing device includes a core component and one or more services. The services may be configured as a pipeline or as microservices. The core component of each computing device is configured to communicate with the one or more services of the respective computing device as well as with the core component of at least one of the other computing devices in order to share data, such as data having a conflict-free replicated data type, and synchronize the core components.

Abstract: A method, a system, and a computer program product may be provided for providing traffic data to a client device. The system may receive from the client device, a request for traffic data corresponding to road segments of at least one map area, said request identifying the at least one map area and determine road segment identifiers corresponding to each of the road segments of the at least one map area and determine traffic data for at least a portion of the road segment identifiers, said traffic data obtained from a traffic data source. The system may further determine a plurality of traffic ranges based on the obtained traffic data and generate a bloom filter set, each bloom filter of the bloom filter set corresponding to a traffic range of the plurality of traffic ranges, wherein each bloom filter encodes road segment identifiers corresponding to the respective traffic range.

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems.

Abstract: Methods described herein relate to answering fuzzy search queries. The method includes receiving one or more search indicator values based on one or more characters of a search query. Each search indicator value includes a digest of the one or more characters of the search query inputted into a minhash function with a salt value input. The method also includes comparing the one or more search indicator values with one or more sets of database indicator values. Each database indicator value in the one or more sets of database indicator values corresponds to a database value. The method further includes causing the transmission of at least one of the one or more database values based on the comparison of the one or more search indicator values with the one or more sets of database indicator values. Corresponding apparatuses, systems, and computer program products are also provided.

Abstract: An approach is provided for embedding information into probe data. The approach involves retrieving a probe data set comprising a plurality of probe data points collected from a probe device. The approach also involves determining the information to embed, wherein the information is a bit string of a specified length. The approach further involves iteratively selecting at least one bit of the bit string to embed into at least one probe data point of the plurality of probe data points to generate an embedded probe data set until at least a predetermined portion of the bit string is embedded.

Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises receiving a node identifier and a first node digest of an update candidate node; obtaining, based on the node identifier, a second node digest of the update candidate node; comparing the first node digest and the second node digest of the update candidate node; and generating, based on the comparison, the update data for the map database, the update data containing one of an indication of unchanged content; node digests of the child nodes of the update candidate node; or updated content corresponding to the update candidate node.

Abstract: Methods described herein relate to offline term searching. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values based on the one or more characters of a search query. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes comparing the one or more search indicator values with one or more sets of database indicator values. Each database indicator value in the one or more sets of database indicator values corresponds to a database value. Corresponding apparatuses and computer program products are also provided.

Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises determining an update candidate node, wherein the update candidate node is associated with a node identifier and a first node digest; sending the node identifier and the first node digest to an update data service; and receiving, from the update data service, a response containing one of node digests of the child nodes of the update candidate node at the update data service; or updated content corresponding to the update candidate node. The method may further include updating the map database based on the received response.

Abstract: Methods described herein relate to making fuzzy search queries. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes causing the transmission of at least one of the one or more search indicator values to one or more index servers corresponding to the salt value input used to generate the at least one of the one or more search indicator values. The method also includes receiving one or more database values from the one or more index servers. Corresponding apparatuses and computer program products are also provided.

Abstract: Provided herein is a method of generating and communicating map version agnostic road identifiers. Methods may include: providing an indication of a route request between an origin and a destination; receiving a list of road link identifiers in response to the route request; in response to the first road link identifier not corresponding to a road link identifier of a network of road link identifiers: applying an XOR function to the first road link identifier and a subsequent road link identifier in the list of road link identifiers; in response to a result of the XOR function applied to the first road link identifier and the subsequent identifier corresponding with a road link identifier of the network of road link identifiers, adding the road link identifier of the network of road link identifiers to the route.

Abstract: Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems.

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or more intermediate points; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.

Abstract: Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or more intermediate points; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.

Abstract: A parking cruise route response is received comprising information identifying a starting location and a target location of a parking cruise route and a bloom filter encoding a route segment set defined by the parking cruise route. Map information of the mobile version of the digital map is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value and a segment that does not satisfy the bloom filter is assigned a positive cost value. A decoded route is determined from the decoded starting segment to the decoded target segment based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle associated with the mobile apparatus is controlled to traverse the decoded route and search for an available parking spot along the decoded route.

Abstract: A route response provided by a network apparatus is received. The route response comprises route information and one or more delay bloom filters. The route response is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. A decoded route is determined based on the route information and the mobile version of the digital map. Based on the one or more delay bloom filters, an expected traffic delay for at least one adjacent segment of the decoded route is determined. An adjacent segment is a segment of the digital map that intersects the decoded route and is not a segment of the decoded route. The decoded route and the expected traffic delay for the at least one adjacent segment of the decoded route is provided via a user interface.

Abstract: A route is determined comprising a list of route segments to be traveled from the network version starting segment to the network version target segment. Map version agnostic information identifying each segment of the list of route segments is accessed from the network version of the digital map. A map version agnostic identifier is generated for each route segment of the list of route segments based on the accessed map version agnostic information. The map version agnostic identifier for each route segment is coded using at least one coding function to generate at least one coded map version agnostic identifier for each route segment. A bloom filter is generated based on the coded map version agnostic identifiers for each route segment. The bloom filter is provided such that a mobile apparatus receives the bloom filter.

Abstract: A route is determined, by a network apparatus storing network version of the digital map, from a starting segment to a target segment. The route comprises a list of route segments from the starting location to the target location. Adjacent segments to the route are identified. An adjacent segment is a segment of the digital map that intersects the route and is not a route segment. An expected traffic delay is determined for each adjacent segment based on traffic data. The adjacent segments are separated into delay groups based on the corresponding expected traffic delays. Delay bloom filters are generated, wherein each delay bloom filter encodes a map version agnostic identifier for the adjacent segments of one of the plurality of delay groups. The delay bloom filters and information identifying the route are provided such that a mobile apparatus receives the delay bloom filters and the information identifying the route.

Abstract: A POI route response is received that comprises information identifying a starting location and a particular number of POIs, and a bloom filter encoding a route segment set defined by routes from the starting location to each of the particular number of POIs. The information identifying the starting location is used to identify a decoded starting segment of the mobile version of the digital map. Map information is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A first decoded route is determined based on the cost value assigned to the segments. The first decoded route is a route from the decoded starting segment to a first POI. The first decoded route is provided via a user interface of the mobile apparatus and/or a vehicle is controlled to traverse the first decoded route.

Abstract: A POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated with the new segment satisfies the query criteria, a POI route from the starting segment to the POI is extracted. Map version agnostic identifiers are generated for each segment of the POI routes. Each of the map version agnostic identifiers are coded using at least one coding function. A bloom filter having the coded map version agnostic identifiers as members is generated. The bloom filter is provided such that a mobile apparatus receives the bloom filter.