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.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The method of claim 1, wherein the particular number is at least two and the bloom filter encodes a route segment set defined by the POI routes corresponding to each of the particular number of POIs.
3. The method of claim 1, wherein the POI request comprises the particular number.
4. The method of claim 1, wherein the query criteria comprise at least one of a POI type or one or more keywords.
5. The method of claim 1, further comprising generating a POI list comprising information identifying each of the particular number of POIs and providing the POI list with the bloom filter.
6. The method of claim 5, wherein the POI list comprises information identifying a target location for each POI route.
7. The method of claim 5, wherein the POI list comprises at least one of a length of each POI route or an expected travel time for each POI route.
8. The method of claim 1, wherein the route determination algorithm is Dijkstra's algorithm and a cost value assigned to each new segment is determined based on at least one of a length of the new segment or an expected travel time for the new segment.
10. The apparatus of claim 9, wherein the particular number is at least two and the bloom filter encodes a route segment set defined by the POI routes corresponding to each of the particular number of POIs.
11. The apparatus of claim 9, wherein the POI request comprises the particular number.
12. The apparatus of claim 9, wherein the query criteria comprise at least one of a POI type or one or more keywords.
13. The apparatus of claim 9, wherein the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least generate a POI list comprising information identifying each of the particular number of POIs and provide the POI list with the bloom filter.
14. The apparatus of claim 13, wherein the POI list comprises information identifying a target location for each POI route.
15. The apparatus of claim 13, wherein the POI list comprises at least one of a length of each POI route or an expected travel time for each POI route.
16. The apparatus of claim 9, wherein the route determination algorithm is Dijkstra's algorithm and a cost value assigned to each new segment is determined based on at least one of a length of the new segment or an expected travel time for the new segment.
18. The computer program product of claim 17, wherein the particular number is at least two and the bloom filter encodes a route segment set defined by the POI routes corresponding to each of the particular number of POIs.
19. The computer program product of claim 17, wherein the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least generate a POI list comprising information identifying each of the particular number of POIs and provide the POI list with the bloom filter.
20. The computer program product of claim 19, wherein the POI list comprises at least one of information identifying a target location for each POI route, a length of each POI route, or an expected travel time for each POI route.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
May 22, 2019
January 31, 2023
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.