Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.

Abstract: A web server receives a request from a client specifying a location and a bounding area. A mapping engine creates a tile grid centered at the specified location. A seed tile is created, including or adjacent to the center location. The web server creates a resource identifier for each tile in the tile grid, and returns the tile grid including the resource identifiers to the client. The resource identifier for each tile includes the location of the seed tile and a position offset for the tile relative to the seed tile, in one embodiment specified in units of northward and eastward movement. The client requests tiles from the system using the resource identifiers previously provided by the system. Upon receiving the request, the mapping engine dynamically renders each requested tile using map data from the map database, and the web server returns the dynamically-generated tiles to the requesting client.

Abstract: Methods and systems for providing a search engine capability for large datasets are disclosed. These methods and systems employ a Partition-by-Query index containing key-values pairs corresponding to keys reflecting concept-ordered search phrases and values reflecting ordered lists of document references that are responsive to the concept-ordered search phrase in a corresponding key. A large Partition-by-Query index may be partitioned across multiple servers depending on the size of the index, or the size of the index may be reduced by compressing query-references pairs into dusters. The methods and systems described herein may to provide suggestions and spelling corrections to the user, thereby improving the user's search engine experience while meeting user expectations for search quality and responsiveness.

Abstract: Methods and systems for providing a search engine capability for large datasets are disclosed. These methods and systems employ a Partition-by-Query index containing key-values pairs corresponding to keys reflecting concept-ordered search phrases and values reflecting ordered lists of document references that are responsive to the concept-ordered search phrase in a corresponding key. A large Partition-by-Query index may be partitioned across multiple servers depending on the size of the index, or the size of the index may be reduced by compressing query-references pairs into clusters. The methods and systems described herein may to provide suggestions and spelling corrections to the user, thereby improving the user's search engine experience while meeting user expectations for search quality and responsiveness.

Abstract: A web server receives a request from a client specifying a location and a bounding area. A mapping engine creates a tile grid centered at the specified location. A seed tile is created, including or adjacent to the center location. The web server creates a resource identifier for each tile in the tile grid, and returns the tile grid including the resource identifiers to the client. The resource identifier for each tile includes the location of the seed tile and a position offset for the tile relative to the seed tile, in one embodiment specified in units of northward and eastward movement. The client requests tiles from the system using the resource identifiers previously provided by the system. Upon receiving the request, the mapping engine dynamically renders each requested tile using map data from the map database, and the web server returns the dynamically-generated tiles to the requesting client.

Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.

Abstract: A web server receives a request from a client specifying a location and a bounding area. A mapping engine creates a tile grid centered at the specified location. A seed tile is created, including or adjacent to the center location. The web server creates a resource identifier for each tile in the tile grid, and returns the tile grid including the resource identifiers to the client. The resource identifier for each tile includes the location of the seed tile and a position offset for the tile relative to the seed tile, in one embodiment specified in units of northward and eastward movement. The client requests tiles from the system using the resource identifiers previously provided by the system. Upon receiving the request, the mapping engine dynamically renders each requested tile using map data from the map database, and the web server returns the dynamically-generated tiles to the requesting client.

Abstract: A web server receives a request from a client specifying a location and a bounding area. A mapping engine creates a tile grid centered at the specified location. A seed tile is created, including or adjacent to the center location. The web server creates a resource identifier for each tile in the tile grid, and returns the tile grid including the resource identifiers to the client. The resource identifier for each tile includes the location of the seed tile and a position offset for the tile relative to the seed tile, in one embodiment specified in units of northward and eastward movement. The client requests tiles from the system using the resource identifiers previously provided by the system. Upon receiving the request, the mapping engine dynamically renders each requested tile using map data from the map database, and the web server returns the dynamically-generated tiles to the requesting client.

Abstract: Methods and systems for providing a geo-search engine capability for large point-of-interest record datasets are disclosed. These methods and systems employ a Partition-by-Query index containing key-values pairs corresponding to keys reflecting concept-ordered geo-search phrases and values reflecting ordered lists of point-of-interest record references that are responsive to the concept-ordered geo-search phrase in a corresponding key. A large Partition-by-Query index may be partitioned across multiple servers depending on the size of the index, or the size of the index may be reduced by compressing query-references pairs into clusters. The methods and systems described herein may provide suggestions and spelling corrections to the user, thereby improving the user's geo-search engine experience while meeting user expectations for geo-search quality and responsiveness.

Abstract: Methods and systems for providing a geo-search engine capability for large point-of-interest record datasets are disclosed. These methods and systems employ a Partition-by-Query index containing key-values pairs corresponding to keys reflecting concept-ordered geo-search phrases and values reflecting ordered lists of point-of-interest record references that are responsive to the concept-ordered geo-search phrase in a corresponding key. A large Partition-by-Query index may be partitioned across multiple servers depending on the size of the index, or the size of the index may be reduced by compressing query-references pairs into clusters. The methods and systems described herein may provide suggestions and spelling corrections to the user, thereby improving the user's geo-search engine experience while meeting user expectations for geo-search quality and responsiveness.

Abstract: Methods and systems for providing a search engine capability for large datasets are disclosed. These methods and systems employ a Partition-by-Query index containing key-values pairs corresponding to keys reflecting concept-ordered search phrases and values reflecting ordered lists of document references that are responsive to the concept-ordered search phrase in a corresponding key. A large Partition-by-Query index may be partitioned across multiple servers depending on the size of the index, or the size of the index may be reduced by compressing query-references pairs into clusters. The methods and systems described herein may to provide suggestions and spelling corrections to the user, thereby improving the user's search engine experience while meeting user expectations for search quality and responsiveness.