Abstract: Systems, methods, and computer-readable media are provided for processing geographic data and identifying geographic locations. In one implementation, a computer-implemented method is provided that is performed by one or more processors, the method comprising operations including receiving a query including an address, parsing the address into tokens, and sending the tokens to one or more harvesters. The method also includes receiving one or more geographic location candidates from the one or more harvesters in response to the tokens, comparing the one or more candidates, and returning one or more geographic locations based on the comparison.

Abstract: Systems and methods are disclosed for partitioning data into n partitions in a database used for information retrieval. According to certain embodiments implemented with at least one processor, a perceived load is determined for each of a plurality of substrings, each of the substrings corresponding to one or more entries in the database. The plurality of substrings are ordered from highest to lowest perceived load. Data associated with each of the first n substrings is assigned to a separate partition, wherein n is greater than one. Moreover, data associated with each of the remaining substrings is assigned to the n partitions based on a score. The score is computed by calculating, for each partition, a load variance and an entropy weight for the candidate substring. The load variance and the entropy weight are combined, and the candidate substring is assigned to the partition that has the lowest combined score.

Abstract: Systems and methods are disclosed for identifying points-of-interest using customized query prediction. According to certain embodiments, a partial query is received from a client via a network. The partial query may comprise a plurality of characters associated with a full query and location data associated with the client. The received partial query may be analyzed using at least one dictionary. Based on the analysis of the received partial query, at least one query may be predicted. Moreover, at least one point-of-interest may be identified based on the at least one predicted query. Further, data associated with the at least one identified point-of-interest may be transmitted over the network to the client prior to receiving the full query from the client.

Abstract: Systems and methods are disclosed for ingesting data, such as point of interest data. According to certain embodiments, a raw data load transmitted over a network is received from a first data source. The raw data load may comprise a plurality of raw data records, which may be stored in a first database. A first plurality of standard data records previously received from the first data source may be accessed and compared to each of the plurality of raw data records to identify at least one added record. The at least one added record may be compared to a second plurality of standard data records received from a second data source to identify a matching record received from the second data source. The at least one added record may be assigned a key from the matching record. Moreover, the updated information may be sent to an update queue, such that applications may be notified of and receive the updates.

Abstract: Computerized systems and methods are provided for generating results of a search query. In accordance with some implementations, data is received that is indicative of a character string related to a location and provided as input by a user. One or more hierarchically organized data trees are retrieved, from a storage device, for administrative areas related to the input character. Thereafter, probable target addresses are determined for the location utilizing the hierarchically organized data trees for each of the administrative areas, and a list of probable target addresses is provided for display to the user based on the hierarchy of the administrative areas.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Abstract: Systems and methods are disclosed for identifying points-of-interest using customized query prediction. According to certain embodiments, a partial query is received from a client via a network. The partial query may comprise a plurality of characters associated with a full query and location data associated with the client. The received partial query may be analyzed using at least one dictionary. Based on the analysis of the received partial query, at least one query may be predicted. Moreover, at least one point-of-interest may be identified based on the at least one predicted query. Further, data associated with the at least one identified point-of-interest may be transmitted over the network to the client prior to receiving the full query from the client.

Abstract: Systems and methods are disclosed for partitioning data into n partitions in a database used for information retrieval. According to certain embodiments implemented with at least one processor, a perceived load is determined for each of a plurality of substrings, each of the substrings corresponding to one or more entries in the database. The plurality of substrings are ordered from highest to lowest perceived load. Data associated with each of the first n substrings is assigned to a separate partition, wherein n is greater than one. Moreover, data associated with each of the remaining substrings is assigned to the n partitions based on a score. The score is computed by calculating, for each partition, a load variance and an entropy weight for the candidate substring. The load variance and the entropy weight are combined, and the candidate substring is assigned to the partition that has the lowest combined score.

Abstract: Computerized systems and methods are provided for generating results of a search query. In accordance with some implementations, data is received that is indicative of a character string related to a location and provided as input by a user. One or more hierarchically organized data trees are retrieved, from a storage device, for administrative areas related to the input character. Thereafter, probable target addresses are determined for the location utilizing the hierarchically organized data trees for each of the administrative areas, and a list of probable target addresses is provided for display to the user based on the hierarchy of the administrative areas.

Abstract: Systems, methods, and computer-readable media are provided for processing geographic data and identifying geographic locations. In one implementation, a computer-implemented method is provided that is performed by one or more processors, the method comprising operations including receiving a query including an address, parsing the address into tokens, and sending the tokens to one or more harvesters. The method also includes receiving one or more geographic location candidates from the one or more harvesters in response to the tokens, comparing the one or more candidates, and returning one or more geographic locations based on the comparison.

Abstract: Systems and methods are disclosed for ingesting data, such as point of interest data. According to certain embodiments, a raw data load transmitted over a network is received from a first data source. The raw data load may comprise a plurality of raw data records, which may be stored in a first database. A first plurality of standard data records previously received from the first data source may be accessed and compared to each of the plurality of raw data records to identify at least one added record. The at least one added record may be compared to a second plurality of standard data records received from a second data source to identify a matching record received from the second data source. The at least one added record may be assigned a key from the matching record. Moreover, the updated information may be sent to an update queue, such that applications may be notified of and receive the updates.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.