USRE44876E1 - Proximity search methods using tiles to represent geographical zones - Google Patents

Proximity search methods using tiles to represent geographical zones Download PDF

Info

Publication number
USRE44876E1
USRE44876E1 US13/277,008 US201113277008A USRE44876E US RE44876 E1 USRE44876 E1 US RE44876E1 US 201113277008 A US201113277008 A US 201113277008A US RE44876 E USRE44876 E US RE44876E
Authority
US
United States
Prior art keywords
location
users
user
index
query
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US13/277,008
Inventor
Nicholas Galbreath
Yuh-Wen Soung
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Meta Platforms Inc
Original Assignee
Facebook Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Facebook Inc filed Critical Facebook Inc
Priority to US13/277,008 priority Critical patent/USRE44876E1/en
Application granted granted Critical
Publication of USRE44876E1 publication Critical patent/USRE44876E1/en
Assigned to META PLATFORMS, INC. reassignment META PLATFORMS, INC. CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: FACEBOOK, INC.
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases

Definitions

  • the present invention generally relates to proximity search techniques, and more specifically, to a method and a system for performing searches based on proximity to a reference location.
  • a geographic location may be represented as latitude and longitude.
  • FIG. 1 illustrates a map of the world with latitude lines shown every 30 degrees and longitude lines shown every 30 degrees. The distance between any two points on the map shown in FIG. 1 may be calculated based on their latitude and longitude positions, and the known radius of the earth (6371.01 km or 3958.76 miles).
  • Latitude and longitude positions for locations specified using zip codes, postal codes and cities may be obtained from third party databases using a simple table look-up.
  • a handheld electronic device such as a pocket PC, cell phone or a personal digital assistant (PDA) may have a GPS receiver and associated software for determining the latitude and longitude position of the handheld electronic device.
  • PDA personal digital assistant
  • a proximity search of database records with respect to a reference location is carried out by calculating the distances between the reference location and the locations associated with each of the database records. First, the latitude and longitude positions of the reference location are obtained. Second, the latitude and longitude positions of the locations associated with the database records are obtained. Third, the distances between the reference location and the locations associated with the database records are calculated. Fourth, the database records associated with locations that are within a certain distance (as specified in the proximity search request) from the reference location are selected to be included in the search results.
  • the proximity search method carried out in the above manner becomes computationally very expensive because of the large number of distance calculations that are required.
  • Distance calculations that are based on zip codes and postal codes have been used to reduce the computational cost, but are not very accurate, and only work for locations in countries having postal codes that are mapped to latitude-longitude values.
  • Quad trees and R-Trees that rely on a two-dimensional grid of regions and subregions have been used to describe the locations of objects in a two-dimensional space, but they require binary-like searches to zero in on the appropriate regions. For proximity searching, they are either too inaccurate (e.g., when the region size is large) or computationally too expensive (e.g., when the region size is sufficiently small).
  • the invention provides an improved proximity search technique that is either faster or more accurate than the ones employed in the current art.
  • the earth is divided into predefined geographic regions of substantially equal areas, referred to as tiles, and records that are searched based on proximity to a reference location include location pointers, each of which identifies a particular tile that encompasses the physical location indicated by the corresponding record.
  • location pointers each of which identifies a particular tile that encompasses the physical location indicated by the corresponding record.
  • the reference location may be specified in the proximity search as a zip code, city-state, or city-country, or the location of the user requesting the proximity search may be retrieved from a database as the reference location. If the user requesting the proximity search is carrying a handheld electronic device that includes a GPS receiver and associated software, the reference location may also be specified as the current location of the user as determined by the GPS receiver and associated software.
  • the latitude and longitude of the reference location are obtained and the tile that includes the latitude and longitude of the reference location is identified.
  • the searched records that have location pointers that point to those tiles that are within the specified distance from the reference location tile are then selected for inclusion in the search results.
  • Proximity searches carried out in the above manner no longer require individual distance calculations between the reference location and each database record being searched. As a result, the total number of distance calculations is reduced with the invention and the speed of the executed searches is increased.
  • the invention also provides flexibility in designing proximity searches, e.g., the accuracy of proximity searches can be increased by decreasing the tile size and the speed of the proximity searches can be increased by increasing the tile size.
  • FIG. 1 is a map of the world illustrating latitude and longitude lines that uniquely identify a location on the map;
  • FIG. 2 is a map of the world employing a coordinate system defining points that represent geographic regions having substantially the same area;
  • FIG. 3 is a diagram illustrating the relationships between members in a social network:
  • FIG. 4 is a block diagram illustrating a system for creating and managing an online social network
  • FIG. 5 shows a simplified user interface with which a new record is entered into a database
  • FIG. 6 is a flow diagram illustrating how a location pointer is obtained for the new record entered in FIG. 5 ;
  • FIG. 7 illustrates a database containing records having location information
  • FIG. 8 shows an input interface for specifying a search query that includes a proximity criteria
  • FIG. 9 is a flow diagram illustrating how search results that are responsive to the search query of FIG. 8 are obtained.
  • Each geographic location in FIG. 1 which can be represented as latitude and longitude, may be mapped onto a point in FIG. 2 .
  • the map of FIG. 1 is divided into a plurality predefined geographical regions or areas, referred to as tiles, and all points contained in one tile map onto a single point in FIG. 2 .
  • a tile can have any configuration, but in the embodiment of the invention described herein, each such tile covers roughly the same area in FIG. 1 and all four sides of each such tile have the same fixed length.
  • the right tip of the triangle in FIG. 2 represents the (LatQ, LongQ) pair corresponding to the tile that contains the equator at the international date line (longitude: 180° E or 180° W).
  • the upper and lower sides of the triangle in FIG. 2 represent the international date line that is approached when moving west to east.
  • a social network is generally defined by the relationships among groups of individuals, and may include relationships ranging from casual acquaintances to close familial bonds.
  • a social network may be represented using a graph structure. Each node of the graph corresponds to a member of the social network. Edges connecting two nodes represent a relationship between two individuals.
  • the degree of separation between any two nodes is defined as the minimum number of hops required to traverse the graph from one node to the other.
  • a degree of separation between two members is a measure of relatedness between the two members.
  • FIG. 3 illustrates a graph representation of a social network centered on a given individual (ME).
  • Other members of this social network include A-U whose position, relative to ME's, is referred to by the degree of separation between ME and each other member.
  • Friends of ME which includes A, B, and C, are separated from ME by one degree of separation (1 d/s).
  • a friend of a friend of ME is separated from ME by 2 d/s.
  • D, E, F and G are each separated from ME by 2 d/s.
  • a friend of a friend of a friend of ME is separated from ME by 3 d/s.
  • FIG. 1 depicts all nodes separated from ME by more than 3 degrees of separation as belonging to the category ALL.
  • Degrees of separation in a social network are defined relative to an individual. For example, in ME's social network, H and ME are separated by 2 d/s, whereas in G's social network. H and G are separated by only 1 d/s. Accordingly, each individual will have their own set of first, second and third degree relationships.
  • an individual's social network may be extended to include nodes to an Nth degree of separation. As the number of degrees increases beyond three, however, the number of nodes typically grows at an explosive rate and quickly begins to mirror the ALL set.
  • FIG. 4 is a block diagram illustrating a system for creating and managing an online social network.
  • FIG. 4 illustrates a system 100 , including an application server 200 and graph servers 300 .
  • the computers of system 100 are connected by a network 400 , e.g., the Internet, and accessible by over the network by a plurality of computers, collectively designated as 500 .
  • the application server 200 manages a member database 210 , a relationship database 220 , and a search database 230 .
  • the member database 210 contains profile information for each of the members in the online social network managed by the system 100 .
  • the profile information may include, among other things: a unique member identifier, name, age, gender, location, hometown, references to image files, listing of interests, attributes, and the like.
  • the location information may include: (i) address, city, state, zip code or postal code, and country; (ii) latitude and longitude values associated with the specified address, zip code, postal code, city-state or city-country; and (iii) a pointer to a tile that includes the location associated with the latitude and longitude values.
  • the relationship database 220 stores information defining to the first degree relationships between members.
  • the relationship database 220 stores information relating to the first degree relationships between members.
  • the contents of the member database 210 are indexed and optimized for search, and stored in the search database 230 .
  • the member database 210 , the relationship database 220 , and the search database 230 are updated to reflect inputs of new member information and edits of existing member information that are made through the computers 500 .
  • the application server 200 also manages the information exchange requests that it receives from the remote computers 500 .
  • the graph servers 300 receive a query from the application server 200 , process the query and return the query results to the application server 200 .
  • Graph servers 300 store a graph representation of the social network defined by all of the members (nodes) and their corresponding relationships (edges).
  • the graph servers 300 respond to requests from application server 200 to identify relationships and the degree of separation between members of the online social network.
  • the application server 200 is further configured to query a third party service 600 for latitude and longitude values corresponding to location information (e.g., address, zip code, postal code, city-state, city-country, etc.) that it sends as a part of the query.
  • the third party service 600 looks up the latitude and longitude values corresponding to the location specified in the query from its database 610 and returns the latitude and longitude values to the application server 200 .
  • the database containing latitude and longitude values corresponding to locations specified in terms of address, zip code, postal code, city-state, and/or city-country may be maintained as part of the computer system 100 and accessed internally by the application server 200 .
  • FIG. 5 shows a simplified user interface with which a new record is entered into the member database 210 .
  • the inputs include location information such as the address, city, state and zip code. Persons not living in the U.S. will enter country information in place of state and postal code information instead of zip code.
  • FIG. 6 is a flow diagram illustrating how a location pointer is obtained for a new record and stored in the member database 210 .
  • user inputs e.g., those made with the user interface of FIG. 5
  • the computer system 100 queries a third party service 600 for latitude and longitude values corresponding to the location information associated with the new record and receives them from the third party service 600 .
  • the location parameters that are passed to the third party service 600 may be address, city, state, country, zip code, postal code, or any combination of the foregoing.
  • the third party service 600 looks up the latitude and longitude values corresponding to the location parameters and returns them to the computer system 100 . In an alternative embodiment, the latitude and longitude look up is not performed by the third party service 600 , but by the computer system 100 .
  • r is the length of the sides of the tiles and is 3.4 miles; and latitude and longitude values are expressed in degrees.
  • Accuracy in the proximity searches can be improved by reducing r, but at the expense of computational speed.
  • Computation speed of the proximity searches can be increased by increasing r, but at the expense of accuracy.
  • Step 604 the (LatQ, LongQ) pair is stored in the member database 210 as part of the new record and is used as a pointer to identify the particular tile that covers the location associated with the new record.
  • the (LatQ, LongQ) pair may be packed into a single integer value.
  • FIG. 7 illustrates a member database 210 containing location information. It shows the location information for records ME, A, B, C, and U, and the corresponding latitude and longitude values. Each record also has a pointer (x, y) that identifies the particular tile that covers the location associated with such record. Each of these pointers was derived in the manner illustrated in FIG. 6 when its corresponding record was entered into the database as a new record.
  • FIG. 8 shows a sample input interface for specifying a search query that includes a proximity criterion.
  • the input parameter “Your Location” defaults to the zip code of the person who is requesting this search, but it may be changed by the user if the user desires to perform the proximity search with respect to a different zip code.
  • the search query is being entered using a handheld electronic device that includes a GPS receiver and associated software that automatically determines the latitude and longitude values associated with the current location of the handheld electronic device, and the user desires to perform the proximity search based on the GPS-determined location, the user leaves the “Your Location” field blank, and the latitude and longitude values determined by the GPS receiver and associated software appears in the corresponding “Latitude” and “Longitude” fields and are passed as part of the search query.
  • the location specified in the “Your Location” field or the GPS-determined location represents the reference location from which the proximity search will be carried out.
  • the input parameter “Proximity” defines the distance value that is used in carrying out the proximity search.
  • a distance value of 25 miles, as illustrated in FIG. 8 means that the proximity search will be carried out for all records having associated locations that are within 25 miles of the reference location.
  • Other input parameters may be specified in conducting a proximity search (e.g., keywords, gender preference, marital status, etc.), but for simplicity, are not illustrated here.
  • the invention is applicable to any type of proximity searches, and not limited to proximity searches for members within a social network.
  • FIG. 9 is a flow diagram illustrating how search results that are responsive to the search query are obtained.
  • the proximity search parameters e.g., those made with the user interface of FIG. 8
  • Step 901 the proximity search parameters, e.g., those made with the user interface of FIG. 8
  • Step 902 a decision is made as to whether latitude and longitude values are passed as part of the search query. If not, the reference location information, e.g., zip code, is passed to the third party service 600 , and the third party service 600 looks up the latitude and longitude values corresponding to the reference location information and returns them to the computer system 100 (Step 903 ). In an alternative embodiment, the latitude and longitude look up is not performed by the third party service 600 , but by the computer system 100 . Flow then proceeds to Step 904 .
  • the reference location information e.g., zip code
  • Step 904 a set of (LatQ, LongQ) values that correspond to the longitude of the reference location and are within the specified distance from the reference location is obtained.
  • Step 905 for each (LatQ, LongQ) value in the set obtained in Step 904 , all LongQ values that are within the specified distance directly to the west and directly to the east (i.e., to the west and to the east along the same latitude) are obtained.
  • Step 906 all (LatQ, LongQ) values obtained in Step 905 are compiled into an array as valid location pointers.
  • Step 907 if any records in the database have (LatQ, LongQ) values that are contained in the array of valid location pointers, these records are included in the search results.

Abstract

A proximity search engine for carrying out a proximity search with respect to a reference location uses as a reference frame the earth divided into tiles, which are predefined geographic regions of substantially equal areas. Records that are searched based on proximity to a reference location include location pointers, each of which identifies a particular tile that encompasses the physical location indicated by the corresponding record. When the proximity search is carried out, the tiles that are within a specified distance from the reference location are obtained and records having location pointers corresponding to such tiles are selected for inclusion in the search results.

Description

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention generally relates to proximity search techniques, and more specifically, to a method and a system for performing searches based on proximity to a reference location.
2. Description of the Related Art
A geographic location may be represented as latitude and longitude. FIG. 1 illustrates a map of the world with latitude lines shown every 30 degrees and longitude lines shown every 30 degrees. The distance between any two points on the map shown in FIG. 1 may be calculated based on their latitude and longitude positions, and the known radius of the earth (6371.01 km or 3958.76 miles).
There are many ways of obtaining the latitude and longitude for a particular geographic location. Latitude and longitude positions for locations specified using zip codes, postal codes and cities may be obtained from third party databases using a simple table look-up. Also, a handheld electronic device, such as a pocket PC, cell phone or a personal digital assistant (PDA), may have a GPS receiver and associated software for determining the latitude and longitude position of the handheld electronic device.
In the current art, a proximity search of database records with respect to a reference location is carried out by calculating the distances between the reference location and the locations associated with each of the database records. First, the latitude and longitude positions of the reference location are obtained. Second, the latitude and longitude positions of the locations associated with the database records are obtained. Third, the distances between the reference location and the locations associated with the database records are calculated. Fourth, the database records associated with locations that are within a certain distance (as specified in the proximity search request) from the reference location are selected to be included in the search results.
When the number of database records is large, the proximity search method carried out in the above manner becomes computationally very expensive because of the large number of distance calculations that are required. Distance calculations that are based on zip codes and postal codes have been used to reduce the computational cost, but are not very accurate, and only work for locations in countries having postal codes that are mapped to latitude-longitude values. Quad trees and R-Trees that rely on a two-dimensional grid of regions and subregions have been used to describe the locations of objects in a two-dimensional space, but they require binary-like searches to zero in on the appropriate regions. For proximity searching, they are either too inaccurate (e.g., when the region size is large) or computationally too expensive (e.g., when the region size is sufficiently small).
SUMMARY OF THE INVENTION
The invention provides an improved proximity search technique that is either faster or more accurate than the ones employed in the current art. According to the invention, the earth is divided into predefined geographic regions of substantially equal areas, referred to as tiles, and records that are searched based on proximity to a reference location include location pointers, each of which identifies a particular tile that encompasses the physical location indicated by the corresponding record. When the proximity search is carried out, the tiles that are within a specified distance from the reference location are obtained and records having location pointers corresponding to such tiles are selected for inclusion in the search results.
The reference location may be specified in the proximity search as a zip code, city-state, or city-country, or the location of the user requesting the proximity search may be retrieved from a database as the reference location. If the user requesting the proximity search is carrying a handheld electronic device that includes a GPS receiver and associated software, the reference location may also be specified as the current location of the user as determined by the GPS receiver and associated software.
After the reference location is determined, the latitude and longitude of the reference location are obtained and the tile that includes the latitude and longitude of the reference location is identified. The searched records that have location pointers that point to those tiles that are within the specified distance from the reference location tile are then selected for inclusion in the search results.
Proximity searches carried out in the above manner no longer require individual distance calculations between the reference location and each database record being searched. As a result, the total number of distance calculations is reduced with the invention and the speed of the executed searches is increased. The invention also provides flexibility in designing proximity searches, e.g., the accuracy of proximity searches can be increased by decreasing the tile size and the speed of the proximity searches can be increased by increasing the tile size.
BRIEF DESCRIPTION OF THE DRAWINGS
So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
FIG. 1 is a map of the world illustrating latitude and longitude lines that uniquely identify a location on the map;
FIG. 2 is a map of the world employing a coordinate system defining points that represent geographic regions having substantially the same area;
FIG. 3 is a diagram illustrating the relationships between members in a social network:
FIG. 4 is a block diagram illustrating a system for creating and managing an online social network;
FIG. 5 shows a simplified user interface with which a new record is entered into a database;
FIG. 6 is a flow diagram illustrating how a location pointer is obtained for the new record entered in FIG. 5;
FIG. 7 illustrates a database containing records having location information;
FIG. 8 shows an input interface for specifying a search query that includes a proximity criteria; and
FIG. 9 is a flow diagram illustrating how search results that are responsive to the search query of FIG. 8 are obtained.
DETAILED DESCRIPTION
Each geographic location in FIG. 1, which can be represented as latitude and longitude, may be mapped onto a point in FIG. 2. In fact, the map of FIG. 1 is divided into a plurality predefined geographical regions or areas, referred to as tiles, and all points contained in one tile map onto a single point in FIG. 2. A tile can have any configuration, but in the embodiment of the invention described herein, each such tile covers roughly the same area in FIG. 1 and all four sides of each such tile have the same fixed length. The formulas used for mapping a location in FIG. 1 that is defined by latitude and longitude onto a point in FIG. 2 are as follows:
LatQ=Int((latitude+90)*k/r+1); and
LongQ=Int((longitude+180)*k Cos (latitude/r+1),
where latitude and longitude values are expressed in degrees; k is a factor for converting a 1-degree arc measured with respect to earth's center into miles (k=2π*(earth's radius)/360°-69.0933 miles/degree); r is the length of each side of a tile (in the illustrated embodiment, r=3.4 miles); and LatQ and LongQ define the position of a tile in the coordinate system shown in FIG. 2.
The LatQ value defines the position of the tile along the x-axis, beginning with LatQ=1, and the LongQ value defines the position of the tile along the y-axis, beginning with LongQ=1. The north pole in FIG. 1 is mapped onto a point at the upper tip of the triangle in FIG. 2 represented by (LatQ=3658, LongQ=1) and the south pole in FIG. 1 is mapped onto a point at the lower tip of the triangle in FIG. 2 represented by (LatQ−1, LongQ−1). The equator, represented by (LatQ=1829, 1<LongQ<7316), maps onto a line that cuts through the center of the triangle in FIG. 2 and divides it into an upper half (northern hemisphere) and a lower half (southern hemisphere). The right tip of the triangle in FIG. 2 represents the (LatQ, LongQ) pair corresponding to the tile that contains the equator at the international date line (longitude: 180° E or 180° W).
The international date line maps onto a line that is shown in FIG. 2 as the left side of the triangle. All other equilongitude lines (i.e., a line connecting points having the same longitude) map onto a pair of lines, the first originating from the north pole (LatQ=3658, LongQ=1) to a point along the equator and the second originating from the south pole (LatQ=1, LongQ=1) to the same point along the equator. The upper and lower sides of the triangle in FIG. 2 represent the international date line that is approached when moving west to east.
The invention will now be described in the context of a social network. A social network is generally defined by the relationships among groups of individuals, and may include relationships ranging from casual acquaintances to close familial bonds. A social network may be represented using a graph structure. Each node of the graph corresponds to a member of the social network. Edges connecting two nodes represent a relationship between two individuals. In addition, the degree of separation between any two nodes is defined as the minimum number of hops required to traverse the graph from one node to the other. A degree of separation between two members is a measure of relatedness between the two members.
FIG. 3 illustrates a graph representation of a social network centered on a given individual (ME). Other members of this social network include A-U whose position, relative to ME's, is referred to by the degree of separation between ME and each other member. Friends of ME, which includes A, B, and C, are separated from ME by one degree of separation (1 d/s). A friend of a friend of ME is separated from ME by 2 d/s. As shown, D, E, F and G are each separated from ME by 2 d/s. A friend of a friend of a friend of ME is separated from ME by 3 d/s. FIG. 1 depicts all nodes separated from ME by more than 3 degrees of separation as belonging to the category ALL.
Degrees of separation in a social network are defined relative to an individual. For example, in ME's social network, H and ME are separated by 2 d/s, whereas in G's social network. H and G are separated by only 1 d/s. Accordingly, each individual will have their own set of first, second and third degree relationships.
As those skilled in the art understand, an individual's social network may be extended to include nodes to an Nth degree of separation. As the number of degrees increases beyond three, however, the number of nodes typically grows at an explosive rate and quickly begins to mirror the ALL set.
FIG. 4 is a block diagram illustrating a system for creating and managing an online social network. As shown, FIG. 4 illustrates a system 100, including an application server 200 and graph servers 300. The computers of system 100 are connected by a network 400, e.g., the Internet, and accessible by over the network by a plurality of computers, collectively designated as 500. The application server 200 manages a member database 210, a relationship database 220, and a search database 230.
The member database 210 contains profile information for each of the members in the online social network managed by the system 100. The profile information may include, among other things: a unique member identifier, name, age, gender, location, hometown, references to image files, listing of interests, attributes, and the like. The location information may include: (i) address, city, state, zip code or postal code, and country; (ii) latitude and longitude values associated with the specified address, zip code, postal code, city-state or city-country; and (iii) a pointer to a tile that includes the location associated with the latitude and longitude values. The relationship database 220 stores information defining to the first degree relationships between members. The relationship database 220 stores information relating to the first degree relationships between members. In addition, the contents of the member database 210 are indexed and optimized for search, and stored in the search database 230. The member database 210, the relationship database 220, and the search database 230 are updated to reflect inputs of new member information and edits of existing member information that are made through the computers 500.
The application server 200 also manages the information exchange requests that it receives from the remote computers 500. The graph servers 300 receive a query from the application server 200, process the query and return the query results to the application server 200. Graph servers 300 store a graph representation of the social network defined by all of the members (nodes) and their corresponding relationships (edges). The graph servers 300 respond to requests from application server 200 to identify relationships and the degree of separation between members of the online social network.
The application server 200 is further configured to query a third party service 600 for latitude and longitude values corresponding to location information (e.g., address, zip code, postal code, city-state, city-country, etc.) that it sends as a part of the query. The third party service 600 looks up the latitude and longitude values corresponding to the location specified in the query from its database 610 and returns the latitude and longitude values to the application server 200. In an alternative embodiment, the database containing latitude and longitude values corresponding to locations specified in terms of address, zip code, postal code, city-state, and/or city-country, may be maintained as part of the computer system 100 and accessed internally by the application server 200.
FIG. 5 shows a simplified user interface with which a new record is entered into the member database 210. The inputs include location information such as the address, city, state and zip code. Persons not living in the U.S. will enter country information in place of state and postal code information instead of zip code.
FIG. 6 is a flow diagram illustrating how a location pointer is obtained for a new record and stored in the member database 210. In Step 601, user inputs, e.g., those made with the user interface of FIG. 5, are received by the computer system 100 and stored in the member database 210. In Step 602, the computer system 100 queries a third party service 600 for latitude and longitude values corresponding to the location information associated with the new record and receives them from the third party service 600. The location parameters that are passed to the third party service 600 may be address, city, state, country, zip code, postal code, or any combination of the foregoing. The third party service 600 looks up the latitude and longitude values corresponding to the location parameters and returns them to the computer system 100. In an alternative embodiment, the latitude and longitude look up is not performed by the third party service 600, but by the computer system 100.
In Step 603, the latitude and longitude values are used to calculate corresponding LatQ and LongQ values using the following formula:
LatQ=Int((latitude+90)*k/r+1); and
LongQ=Int((longitude+180)*k* Cos (latitude)/r+1).
where k is a factor for converting a 1-degree arc measured with respect to earth's center into miles (k=2π*(earth's radius)/360°=69.0933 miles/degree); r is the length of the sides of the tiles and is 3.4 miles; and latitude and longitude values are expressed in degrees. Accuracy in the proximity searches can be improved by reducing r, but at the expense of computational speed. Computation speed of the proximity searches can be increased by increasing r, but at the expense of accuracy.
In Step 604, the (LatQ, LongQ) pair is stored in the member database 210 as part of the new record and is used as a pointer to identify the particular tile that covers the location associated with the new record. To optimize for database indexing, the (LatQ, LongQ) pair may be packed into a single integer value.
FIG. 7 illustrates a member database 210 containing location information. It shows the location information for records ME, A, B, C, and U, and the corresponding latitude and longitude values. Each record also has a pointer (x, y) that identifies the particular tile that covers the location associated with such record. Each of these pointers was derived in the manner illustrated in FIG. 6 when its corresponding record was entered into the database as a new record. For example, the record ME has a zip code 94087 which, according to a latitude and longitude look-up service, is located at 37.40 N latitude and 122.00 W longitude, and this location maps onto a tile that is located at point (x=2589, y=937).
FIG. 8 shows a sample input interface for specifying a search query that includes a proximity criterion. The input parameter “Your Location” defaults to the zip code of the person who is requesting this search, but it may be changed by the user if the user desires to perform the proximity search with respect to a different zip code. If the search query is being entered using a handheld electronic device that includes a GPS receiver and associated software that automatically determines the latitude and longitude values associated with the current location of the handheld electronic device, and the user desires to perform the proximity search based on the GPS-determined location, the user leaves the “Your Location” field blank, and the latitude and longitude values determined by the GPS receiver and associated software appears in the corresponding “Latitude” and “Longitude” fields and are passed as part of the search query. The location specified in the “Your Location” field or the GPS-determined location represents the reference location from which the proximity search will be carried out.
The input parameter “Proximity” defines the distance value that is used in carrying out the proximity search. A distance value of 25 miles, as illustrated in FIG. 8, means that the proximity search will be carried out for all records having associated locations that are within 25 miles of the reference location. Other input parameters may be specified in conducting a proximity search (e.g., keywords, gender preference, marital status, etc.), but for simplicity, are not illustrated here. Also, the invention is applicable to any type of proximity searches, and not limited to proximity searches for members within a social network.
FIG. 9 is a flow diagram illustrating how search results that are responsive to the search query are obtained. In Step 901, the proximity search parameters, e.g., those made with the user interface of FIG. 8, are received by the computer system 100. In Step 902, a decision is made as to whether latitude and longitude values are passed as part of the search query. If not, the reference location information, e.g., zip code, is passed to the third party service 600, and the third party service 600 looks up the latitude and longitude values corresponding to the reference location information and returns them to the computer system 100 (Step 903). In an alternative embodiment, the latitude and longitude look up is not performed by the third party service 600, but by the computer system 100. Flow then proceeds to Step 904.
If the latitude and longitude values are passed as part of the search query, Step 903 is skipped and flow proceeds directly to Step 904. In Step 904, a set of (LatQ, LongQ) values that correspond to the longitude of the reference location and are within the specified distance from the reference location is obtained. In Step 905, for each (LatQ, LongQ) value in the set obtained in Step 904, all LongQ values that are within the specified distance directly to the west and directly to the east (i.e., to the west and to the east along the same latitude) are obtained. In Step 906, all (LatQ, LongQ) values obtained in Step 905 are compiled into an array as valid location pointers. In Step 907, if any records in the database have (LatQ, LongQ) values that are contained in the array of valid location pointers, these records are included in the search results.
The code that implements Steps 904-906 of FIG. 9 is reproduced below:
  • Range=Round((Distance−(r/2.0))/r); //r=3.4 miles, as specified before;
  • Distance represents the distance value that is specified in the search query;
Round represents an integer operation of rounding up
for (i = −Range; i <= Range; i++) {
midBoxLat = latitude + i * r / k; // latitude is the latitude of
the reference location; k is the factor for converting 1 degree of
latitude into miles and equals 69.0933 miles/degree
midBoxLatQ = Int((midBoxLat + 90)*k/r+1);
midBoxLonQ = Int((longitude+180)*k*Cos(midBoxLat)/r+1); //
longitude is the longitude of the reference location
for (j = midBoxLonQ − Range; j <= midBoxLonQ +Range; j++) {
list.add((midBoxLatQ | j);
}
}
While particular embodiments according to the invention have been illustrated and described above, those skilled in the art understand that the invention can take a variety of forms and embodiments within the scope of the appended claims.

Claims (32)

What is claimed is:
1. A method carried out by a computer system of identifying records based on proximity to a reference location in response to a search query, comprising the steps of:
by one or more computing devices, determining location data representative of the reference location; converting said location data into a reference location pointer that points to one of a plurality of predefined geographic regions, each of the predefined geographic regions having four sides of an equal surface distance and associated with a location pointer having a first index and a second index, the first index and the second index identifying a point on a coordinate system;
by the one or more computing devices, identifying a set of location pointers whose corresponding predefined geographic regions are within a certain distance from the predefined geographic region corresponding to the reference location pointer using an integer number, N, which is obtained by dividing the certain distance by the equal surface distance, wherein each of the location pointers in the set has a first index that differs from the first index of the reference location pointer by no more than N and a second index that differs from a third index by no more than N, wherein the third index is a function of the first index of the reference location pointer and represents the same longitudinal position as the reference location pointer; and
by the one or more computing devices, identifying records having location pointers that are in the set.
2. The method according to claim 1, wherein the search query specifies the certain distance.
3. The method according to claim 2, wherein the reference location is the location from which the search query is received.
4. The method according to claim 2, wherein the reference location is the location specified in a record corresponding to the user who submitted the search query.
5. The method according to claim 1, further comprising the step of maintaining a plurality of records in a database, each of the plurality of records including a location pointer to one of the plurality of predefined geographic regions.
6. The method according to claim 5, wherein the predefined geographic regions corresponding to the set of location pointers comprises a subset of the plurality of predefined geographic regions.
7. The method according to claim 1, wherein said location data comprises latitude and longitude values.
8. A record management system for performing searches based on proximity to a reference location, comprising:
a memory device containing a plurality of searchable records, each searchable record including a location pointer that corresponds to one of a plurality of predefined geographic regions, each of the predefined geographic regions having four sides of an equal surface distance and associated with a location pointer having a first index and a second index, the first index and the second index identifying a point on a coordinate system; and
a processor programmed to: (i) receive a search query including the reference location and a distance value; (ii) generate a reference location pointer having a first index and a second index for the reference location; (iii) divide the distance value by the equal surface distance to obtain an integer number, N; (iv) identify a set of location pointers having a first index that differs from the first index of the reference location pointer by no more than N and a second index that differs from a third index by no more than N, wherein the third index is a function of the first index of the reference location pointer and represents the same longitudinal position as the reference location pointer; and (v) return records having location pointers in the identified set.
9. The system according to claim 8, wherein the processor is further programmed to: (i) receive an input of a searchable record including location information associated with the searchable record; (ii) convert the location information into a location pointer that corresponds to one of the plurality of predefined geographic regions; and (iii) store the location pointer.
10. The system according to claim 9, wherein the location information comprises a zip code.
11. The system according to claim 9, wherein the location information includes city and country.
12. A method comprising:
by one or more computing devices, receiving a query from a first user of a social-networking system, the social-networking system comprising a graph that comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, the query comprising one or more location data corresponding to a location of the first user;
by the computing devices, identifying one or more second users of the social-networking system that are connected to the first user within the social-networking system, at least one node in the graph corresponding to each of the second users, at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to a second user being connected to each other by one or more edges;
by the computing devices, determining a location of each of one or more of the second users;
by the computing devices, identifying one or more of the second users that are located within a threshold distance of the location of the first user, wherein identifying one or more of the second users that are located within a threshold distance of the location of the first users comprises:
by the computing devices, converting location information associated with each of at least one of the nodes corresponding to the second users to a location pointer that points to one of a plurality of predefined geographic regions, each of the plurality of predefined geographic regions having four sides of an equal surface distance and is associated with a location pointer having a first index and a second index, the first index and the second index identifying a point on a coordinate system;
by the computing devices, converting the one or more location data into a reference location pointer that points to one of the plurality of predefined geographic regions; and
by the computing devices, identifying a set of location pointers whose corresponding predefined geographic regions are within the distance from the predefined geographic region corresponding to the reference location pointer using an integer number, N, which is obtained by dividing the distance by the equal surface distance, wherein each location pointer from the set of location pointers has a first index that differs from the first index of the reference location pointer by no more than N and a second index that differs from a third index by no more than N, wherein the third index is a function of the first index of the reference location pointer and represents the same longitudinal position as the reference location pointer; and
by the computing devices, providing, as a response to the query, information associated with each of one or more of the second users that are located within the threshold distance of the location of the first user.
13. The method of claim 12, further comprising sending the response to the first user.
14. The method of claim 12, wherein the query comprises the threshold distance.
15. The method of claim 12, wherein:
the query comprises one or more keywords;
each of one or more nodes in the graph corresponding to each of one or more second users is associated with one or more keywords;
the method further comprises, by the computing devices, identifying among the second users that are located within the threshold distance of the location of the first user one or more second users that correspond to nodes associated with keywords matching the keywords of the query; and
information associated with a second user is provided as a response to the query only if the node corresponding to the second is associated with keywords matching the keywords in the query.
16. The method of claim 12, wherein:
the query comprises a gender;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a gender of the second user;
the method further comprises, by the computing devices, identifying among the second users that are located within the threshold distance of the location of the first user one or more second users that match the gender in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the gender in the query.
17. The method of claim 12, wherein:
the query comprises a marital status;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a marital status of the second user;
the method further comprises, by the computing devices, identifying among the second users that are located within the threshold distance of the location of the first user one or more second users that match the marital status in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the marital status in the query.
18. The method of claim 12 wherein identifying one or more of the second users that are located within a threshold distance of the location of the first users comprises:
mapping location information associated with each of at least one of the nodes corresponding to the second users to one of a plurality of geographic regions; and
mapping the location data to a first geographic region of the plurality of geographic regions.
19. A system comprising:
a memory comprising instructions executable by one or more processors; and
the processors coupled to the memory and operable to execute the instructions, the one or more processors being operable when executing the instructions to:
receive a query from a first user of a social-networking system, the social-networking system comprising a graph that comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, the query comprising one or more location data corresponding to a location of the first user;
identify one or more second users of the social-networking system that are connected to the first user within the social-networking system, at least one node in the graph corresponding to each of the second users, at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to a second user being connected to each other by one or more edges;
determine a location of each of one or more of the second users;
identify one or more of the second users that are located within a threshold distance of the location of the first user, wherein to identify one or more of the second users that are located within a threshold distance of the location of the first users, the one or more processors are operable when executing the instructions to:
convert location information associated with each of at least one of the nodes corresponding to the second users to a location pointer that points to one of a plurality of predefined geographic regions, each of the plurality of predefined geographic regions having four sides of an equal surface distance and is associated with a location pointer having a first index and a second index, the first index and the second index identifying a point on a coordinate system;
convert the one or more location data into a reference location pointer that points to one of the plurality of predefined geographic regions; and
identify a set of location pointers whose corresponding predefined geographic regions are within the distance from the predefined geographic region corresponding to the reference location pointer using an integer number, N, which is obtained by dividing the distance by the equal surface distance, wherein each location pointer from the set of location pointers has a first index that differs from the first index of the reference location pointer by no more than N and a second index that differs from a third index by no more than N, wherein the third index is a function of the first index of the reference location pointer and represents the same longitudinal position as the reference location pointer; and
provide as a response to the query information associated with each of one or more of the second users that are located within the threshold distance of the location of the first user.
20. The system of claim 19, wherein the processors are further operable when executing the instructions to send the response to the first user.
21. The system of claim 19, wherein the query comprises the threshold distance.
22. The system of claim 19, wherein:
the query comprises one or more keywords;
each of one or more nodes in the graph corresponding to each of one or more second users is associated with one or more keywords;
the processors are further operable when executing the instructions to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that correspond to nodes associated with keywords matching the keywords of the query; and
information associated with a second user is provided as a response to the query only if the node corresponding to the second is associated with keywords matching the keywords in the query.
23. The system of claim 19, wherein:
the query comprises a gender;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a gender of the second user;
the processors are further operable when executing the instructions to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that match the gender in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the gender in the query.
24. The system of claim 19, wherein:
the query comprises a marital status;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a marital status of the second user;
the processors are further operable when executing the instructions to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that match the marital status in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the marital status in the query.
25. The system of claim 19, wherein, to identify one or more of the second users that are located within a threshold distance of the location of the first users, the processors are operable when executing the instructions to:
map location information associated with each of at least one of the nodes corresponding to the second users to one of a plurality of geographic regions; and
map the location data to a first geographic region of the plurality of geographic regions.
26. One or more computer-readable non-transitory storage media embodying software operable when executed by one or more computer systems to:
receive a query from a first user of a social-networking system, the social-networking system comprising a graph that comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user, the query comprising one or more location data corresponding to a location of the first user;
identify one or more second users of the social-networking system that are connected to the first user within the social-networking system, at least one node in the graph corresponding to each of the second users, at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to a second user being connected to each other by one or more edges;
determine a location of each of one or more of the second users;
identify one or more of the second users that are located within a threshold distance of the location of the first user, wherein, to identify one or more of the second users that are located within a threshold distance of the location of the first users, the software is further operable when executed to:
convert location information associated with each of at least one of the nodes corresponding to the second users to a location pointer that points to one of a plurality of predefined geographic regions, each of the plurality of predefined geographic regions having four sides of an equal surface distance and is associated with a location pointer having a first index and a second index, the first index and the second index identifying a point on a coordinate system;
convert the one or more location data into a reference location pointer that points to one of the plurality of predefined geographic regions; and
identify a set of location pointers whose corresponding predefined geographic regions are within the distance from the predefined geographic region corresponding to the reference location pointer using an integer number, N, which is obtained by dividing the distance by the equal surface distance, wherein each location pointer from the set of location pointers has a first index that differs from the first index of the reference location pointer by no more than N and a second index that differs from a third index by no more than N, wherein the third index is a function of the first index of the reference location pointer and represents the same longitudinal position as the reference location pointer; and
provide as a response to the query information associated with each of one or more of the second users that are located within the threshold distance of the location of the first user.
27. The media of claim 26, wherein the software is further operable when executed to send the response to the first user.
28. The media of claim 26, wherein the query comprises the threshold distance.
29. The media of claim 26, wherein:
each of one or more nodes in the graph corresponding to each of one or more second users is associated with one or more keywords;
the software is further operable when executed to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that correspond to nodes associated with keywords matching the keywords of the query; and
information associated with a second user is provided as a response to the query only if the node corresponding to the second is associated with keywords matching the keywords in the query.
30. The media of claim 26, wherein:
the query comprises a gender;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a gender of the second user;
the software is further operable when executed to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that match the gender in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the gender in the query.
31. The media of claim 26, wherein:
the query comprises a marital status;
each of one or more nodes in the graph corresponding to each of one or more second users indicates a marital status of the second user;
the software is further operable when executed to identify among the second users that are located within the threshold distance of the location of the first user one or more second users that match the marital status in the query; and
information associated with a second user is provided as a response to the query only if the second user matches the marital status in the query.
32. The media of claim 26, wherein, to identify one or more of the second users that are located within a threshold distance of the location of the first users, the software is further operable when executed to:
map location information associated with each of at least one of the nodes corresponding to the second users to one of a plurality of geographic regions; and
map the location data to a first geographic region of the plurality of geographic regions.
US13/277,008 2004-09-14 2011-10-19 Proximity search methods using tiles to represent geographical zones Active 2027-01-01 USRE44876E1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/277,008 USRE44876E1 (en) 2004-09-14 2011-10-19 Proximity search methods using tiles to represent geographical zones

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/941,227 US7606687B2 (en) 2004-09-14 2004-09-14 Proximity search methods using tiles to represent geographical zones
US13/277,008 USRE44876E1 (en) 2004-09-14 2011-10-19 Proximity search methods using tiles to represent geographical zones

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/941,227 Reissue US7606687B2 (en) 2004-09-14 2004-09-14 Proximity search methods using tiles to represent geographical zones

Publications (1)

Publication Number Publication Date
USRE44876E1 true USRE44876E1 (en) 2014-04-29

Family

ID=36035209

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/941,227 Ceased US7606687B2 (en) 2004-09-14 2004-09-14 Proximity search methods using tiles to represent geographical zones
US13/277,008 Active 2027-01-01 USRE44876E1 (en) 2004-09-14 2011-10-19 Proximity search methods using tiles to represent geographical zones

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10/941,227 Ceased US7606687B2 (en) 2004-09-14 2004-09-14 Proximity search methods using tiles to represent geographical zones

Country Status (1)

Country Link
US (2) US7606687B2 (en)

Families Citing this family (52)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7593740B2 (en) 2004-05-12 2009-09-22 Google, Inc. Location-based social software for mobile devices
ES2391566T3 (en) 2004-10-29 2012-11-27 Skyhook Wireless, Inc. Database and location beacon server, method to build a location beacon database, and location-based service that uses it
US8369264B2 (en) 2005-10-28 2013-02-05 Skyhook Wireless, Inc. Method and system for selecting and providing a relevant subset of Wi-Fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources
EP1851979B1 (en) * 2005-02-22 2018-06-13 Skyhook Wireless, Inc. Method of continuous data optimization in a positioning system
US7353034B2 (en) 2005-04-04 2008-04-01 X One, Inc. Location sharing and tracking using mobile phones or other wireless devices
JP4742660B2 (en) * 2005-04-25 2011-08-10 富士ゼロックス株式会社 Document processing system
US7529795B2 (en) 2006-03-20 2009-05-05 Stragent, Llc Message board aggregator
JP2009543074A (en) 2006-07-07 2009-12-03 スカイフック ワイヤレス,インク. System and method for collecting information from a WLAN-enabled access point to estimate the location of a WLAN positioning device
US7647351B2 (en) 2006-09-14 2010-01-12 Stragent, Llc Web scrape template generation
US20080108027A1 (en) * 2006-10-20 2008-05-08 Sallin Matthew D Graphical radially-extending family hedge
US8224298B2 (en) 2007-02-05 2012-07-17 Boadin Technology, LLC Systems and methods for mobile media services utilizing a short form command structure
US8229458B2 (en) 2007-04-08 2012-07-24 Enhanced Geographic Llc Systems and methods to determine the name of a location visited by a user of a wireless device
US9037409B2 (en) * 2007-05-04 2015-05-19 Ian Cummings Navigator database search methods
US20090049031A1 (en) * 2007-08-14 2009-02-19 Hepburn Neil C Method And System For Database Searching
US8117225B1 (en) 2008-01-18 2012-02-14 Boadin Technology, LLC Drill-down system, method, and computer program product for focusing a search
US8117242B1 (en) 2008-01-18 2012-02-14 Boadin Technology, LLC System, method, and computer program product for performing a search in conjunction with use of an online application
US20090327928A1 (en) * 2008-03-05 2009-12-31 Anastasia Dedis Method and System Facilitating Two-Way Interactive Communication and Relationship Management
US20110161827A1 (en) * 2008-03-05 2011-06-30 Anastasia Dedis Social media communication and contact organization
WO2009132106A2 (en) * 2008-04-22 2009-10-29 Oxford J Craig System and method for interactive map, database, and social networking engine
US9128981B1 (en) 2008-07-29 2015-09-08 James L. Geer Phone assisted ‘photographic memory’
US8078397B1 (en) 2008-08-22 2011-12-13 Boadin Technology, LLC System, method, and computer program product for social networking utilizing a vehicular assembly
US8073590B1 (en) 2008-08-22 2011-12-06 Boadin Technology, LLC System, method, and computer program product for utilizing a communication channel of a mobile device by a vehicular assembly
US8265862B1 (en) 2008-08-22 2012-09-11 Boadin Technology, LLC System, method, and computer program product for communicating location-related information
US8190692B1 (en) 2008-08-22 2012-05-29 Boadin Technology, LLC Location-based messaging system, method, and computer program product
US8131458B1 (en) 2008-08-22 2012-03-06 Boadin Technology, LLC System, method, and computer program product for instant messaging utilizing a vehicular assembly
EP2194466A1 (en) * 2008-11-28 2010-06-09 SEARCHTEQ GmbH Method and system for indexing data in a search engine or a database for speed-optimized proximity queries with different radii
US20100306249A1 (en) * 2009-05-27 2010-12-02 James Hill Social network systems and methods
US8321435B2 (en) 2009-08-12 2012-11-27 Apple Inc. Quick find for data fields
US8406785B2 (en) 2009-08-18 2013-03-26 Skyhook Wireless, Inc. Method and system for estimating range of mobile device to wireless installation
EP2529324A4 (en) * 2010-01-29 2016-06-01 Lexisnexis Risk Data Man Inc Statistical record linkage calibration for geographic proximity matching
US8619643B2 (en) 2010-03-24 2013-12-31 Skyhook Wireless, Inc. System and method for estimating the probability of movement of access points in a WLAN-based positioning system
US8700053B2 (en) 2010-06-11 2014-04-15 Skyhook Wireless, Inc. Systems for and methods of determining likelihood of relocation of reference points in a positioning system
WO2012008940A1 (en) * 2010-07-12 2012-01-19 Thomson Licensing System, method and user interface for content search
US8606294B2 (en) 2010-10-05 2013-12-10 Skyhook Wireless, Inc. Method of and system for estimating temporal demographics of mobile users
KR20120053868A (en) * 2010-11-18 2012-05-29 한국전자통신연구원 A apparatus for providing semantic context and a method thereof
SE1100374A1 (en) * 2011-05-17 2012-11-18 Jan Stocklassa System and procedure
US20120331561A1 (en) 2011-06-22 2012-12-27 Broadstone Andrew J Method of and Systems for Privacy Preserving Mobile Demographic Measurement of Individuals, Groups and Locations Over Time and Space
US8996573B2 (en) 2011-10-10 2015-03-31 George Peter Kelesis Journaling system with segregated data access
US20130103595A1 (en) * 2011-10-24 2013-04-25 Fannie Mae Searching real estate using spatial exclusion conditions
US20130339094A1 (en) * 2012-06-13 2013-12-19 Fannie Mae System and method for including and excluding specific comparables
US20140067658A1 (en) * 2012-09-06 2014-03-06 Hassen Damon Alhandy Internet operating system and method
US9226111B2 (en) 2012-11-21 2015-12-29 Apple Inc. Pathway matching
US8849308B2 (en) * 2012-11-21 2014-09-30 Apple Inc. Tiling of map data
US8996302B2 (en) 2012-11-30 2015-03-31 Apple Inc. Reduction of the impact of hard limit constraints in state space models
US9031573B2 (en) * 2012-12-31 2015-05-12 Qualcomm Incorporated Context-based parameter maps for position determination
US9501526B2 (en) * 2013-04-17 2016-11-22 Excalibur Ip, Llc Efficient database searching
US9826375B2 (en) * 2014-05-12 2017-11-21 Rufus Labs, Inc. System and method for social networking among mutually-interested users
US9589305B2 (en) 2014-12-30 2017-03-07 Facebook, Inc. Techniques for graph based natural language processing
US10796015B2 (en) 2017-03-29 2020-10-06 Mybitchbook, Inc. Method and system for anonymous user data storage and controlled data access
CA3052163A1 (en) * 2018-08-15 2020-02-15 Royal Bank Of Canada Systems, methods, and devices for payment recovery platform
US11405474B2 (en) 2019-11-01 2022-08-02 Microsoft Technology Licensing, Llc Abstracting geographic location to a square block of pre-defined size
US11502908B1 (en) * 2021-06-02 2022-11-15 Zscaler, Inc. Geo tagging for advanced analytics and policy enforcement on remote devices

Citations (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5839088A (en) 1996-08-22 1998-11-17 Go2 Software, Inc. Geographic location referencing system and method
US5848373A (en) * 1994-06-24 1998-12-08 Delorme Publishing Company Computer aided map location system
US5950200A (en) 1997-01-24 1999-09-07 Gil S. Sudai Method and apparatus for detection of reciprocal interests or feelings and subsequent notification
US5956397A (en) * 1993-02-22 1999-09-21 Murex Securities, Ltd. Automatic routing and information system for telephonic services
US5963951A (en) * 1997-06-30 1999-10-05 Movo Media, Inc. Computerized on-line dating service for searching and matching people
US5968109A (en) * 1996-10-25 1999-10-19 Navigation Technologies Corporation System and method for use and storage of geographic data on physical media
US5974419A (en) * 1996-10-25 1999-10-26 Navigation Technologies Corporation Parcelization of geographic data for storage and use in a navigation application
US5978768A (en) * 1997-05-08 1999-11-02 Mcgovern; Robert J. Computerized job search system and method for posting and searching job openings via a computer network
US6014090A (en) 1997-12-22 2000-01-11 At&T Corp. Method and apparatus for delivering local information to travelers
US6052122A (en) 1997-06-13 2000-04-18 Tele-Publishing, Inc. Method and apparatus for matching registered profiles
US6061681A (en) 1997-06-30 2000-05-09 Movo Media, Inc. On-line dating service for locating and matching people based on user-selected search criteria
US6073105A (en) 1997-06-13 2000-06-06 Tele-Publishing, Inc. Interactive personals online network method and apparatus
US6073138A (en) 1998-06-11 2000-06-06 Boardwalk A.G. System, method, and computer program product for providing relational patterns between entities
US6175831B1 (en) 1997-01-17 2001-01-16 Six Degrees, Inc. Method and apparatus for constructing a networking database and system
US6202023B1 (en) 1996-08-22 2001-03-13 Go2 Systems, Inc. Internet based geographic location referencing system and method
US6266612B1 (en) 1996-10-24 2001-07-24 Trimble Navigation Limited Position based personal digital assistant
US6269369B1 (en) 1997-11-02 2001-07-31 Amazon.Com Holdings, Inc. Networked personal contact manager
US6324541B1 (en) 1998-06-11 2001-11-27 Boardwalk Ltd. System, method, and computer program product for providing relational patterns between entities
US6326918B1 (en) 1995-06-06 2001-12-04 Wayport, Inc. Method and apparatus for geographic-based communications service
US6339397B1 (en) 2000-06-01 2002-01-15 Lat-Lon, Llc Portable self-contained tracking unit and GPS tracking system
US6343317B1 (en) 1999-12-29 2002-01-29 Harry A. Glorikian Internet system for connecting client-travelers with geographically-associated data
US6343274B1 (en) 1998-09-11 2002-01-29 Hewlett-Packard Apparatus and method for merchant-to-consumer advertisement communication system
US6347230B2 (en) 1995-07-25 2002-02-12 Ace K Computer Co., Ltd. Position display system of mobile terminal
US6349290B1 (en) 1998-06-30 2002-02-19 Citibank, N.A. Automated system and method for customized and personalized presentation of products and services of a financial institution
US6349257B1 (en) 1999-09-15 2002-02-19 International Business Machines Corporation System for personalized mobile navigation information
US6353785B1 (en) 1999-03-12 2002-03-05 Navagation Technologies Corp. Method and system for an in-vehicle computer architecture
US6356812B1 (en) 2000-09-14 2002-03-12 International Business Machines Corporation Method and apparatus for displaying information in a vehicle
US6356838B1 (en) 2000-07-25 2002-03-12 Sunil Paul System and method for determining an efficient transportation route
US6360167B1 (en) 1999-01-29 2002-03-19 Magellan Dis, Inc. Vehicle navigation system with location-based multi-media annotation
US6363427B1 (en) 1998-12-18 2002-03-26 Intel Corporation Method and apparatus for a bulletin board system
US6366962B1 (en) 1998-12-18 2002-04-02 Intel Corporation Method and apparatus for a buddy list
US6370566B2 (en) 1998-04-10 2002-04-09 Microsoft Corporation Generating meeting requests and group scheduling from a mobile device
US6370513B1 (en) 1997-08-08 2002-04-09 Parasoft Corporation Method and apparatus for automated selection, organization, and recommendation of items
US6374177B1 (en) 2000-09-20 2002-04-16 Motorola, Inc. Method and apparatus for providing navigational services in a wireless communication device
US6381603B1 (en) 1999-02-22 2002-04-30 Position Iq, Inc. System and method for accessing local information by using referencing position system
US20020051540A1 (en) * 2000-10-30 2002-05-02 Glick Barry J. Cryptographic system and method for geolocking and securing digital information
US20020054082A1 (en) * 1999-01-02 2002-05-09 Karpf Ronald S. System and method for providing accurate geocoding of responses to location questions in a computer assisted self interview
US6401039B1 (en) * 1997-02-10 2002-06-04 Baron Services, Inc. System and method for projecting storms using NEXRAD attributes
US6408309B1 (en) 2000-02-23 2002-06-18 Dinesh Agarwal Method and system for creating an interactive virtual community of famous people
US20020086676A1 (en) 2000-06-10 2002-07-04 Hendrey Geoffrey R. Method and system for connecting mobile users based on degree of separation
US20020106066A1 (en) * 2001-02-05 2002-08-08 Onepub.Com System and methods for providing anonymous telephone communications
US20020123934A1 (en) * 2000-07-07 2002-09-05 Tanaka Hirohisa A. Method and apparatus for location-sensitive, subsidized cell phone billing
US20020151315A1 (en) * 2000-12-13 2002-10-17 Gravitate, Inc. Managing and querying moving point data
US6505121B1 (en) 2001-08-01 2003-01-07 Hewlett-Packard Company Onboard vehicle navigation system
US6542748B2 (en) 2000-06-10 2003-04-01 Telcontar Method and system for automatically initiating a telecommunications connection based on distance
US20030063072A1 (en) * 2000-04-04 2003-04-03 Brandenberg Carl Brock Method and apparatus for scheduling presentation of digital content on a personal communication device
US20030069693A1 (en) * 2001-01-16 2003-04-10 Snapp Douglas N. Geographic pointing device
US20030074471A1 (en) * 2000-04-03 2003-04-17 Mark Anderson Method and apparatus for estimating a geographic location of a networked entity
US20030154194A1 (en) 2001-12-28 2003-08-14 Jonas Jeffrey James Real time data warehousing
US6618593B1 (en) 2000-09-08 2003-09-09 Rovingradar, Inc. Location dependent user matching system
US20040034601A1 (en) 2002-08-16 2004-02-19 Erwin Kreuzer System and method for content distribution and reselling
US6701307B2 (en) * 1998-10-28 2004-03-02 Microsoft Corporation Method and apparatus of expanding web searching capabilities
US20040064334A1 (en) * 2000-10-10 2004-04-01 Geosign Corporation Method and apparatus for providing geographically authenticated electronic documents
US20040066330A1 (en) * 1997-08-19 2004-04-08 Siemens Automotive Corporation, A Delaware Corporation Vehicle information system
US20040077359A1 (en) 2001-02-08 2004-04-22 Anette Bernas Method and apparatus for providing position profiles in mobile value-added services
US20040076279A1 (en) * 2000-05-16 2004-04-22 John Taschereau Method and system for providing geographically targeted information and advertising
US6735568B1 (en) 2000-08-10 2004-05-11 Eharmony.Com Method and system for identifying people who are likely to have a successful relationship
US6741188B1 (en) 1999-10-22 2004-05-25 John M. Miller System for dynamically pushing information to a user utilizing global positioning system
US20040104842A1 (en) * 1997-08-19 2004-06-03 Siemens Vdo Automotive Corporation, A Delaware Corporation Driver information system
US20040110515A1 (en) * 2000-02-29 2004-06-10 Blumberg Brad W. System and method for providing information based on geographic position
US20040117358A1 (en) * 2002-03-16 2004-06-17 Von Kaenel Tim A. Method, system, and program for an improved enterprise spatial system
US20040139049A1 (en) * 1996-08-22 2004-07-15 Wgrs Licensing Company, Llc Unified geographic database and method of creating, maintaining and using the same
US20040144301A1 (en) 2003-01-24 2004-07-29 Neudeck Philip G. Method for growth of bulk crystals by vapor phase epitaxy
US20040148275A1 (en) 2003-01-29 2004-07-29 Dimitris Achlioptas System and method for employing social networks for information discovery
US20040198398A1 (en) * 2003-04-01 2004-10-07 International Business Machines Corporation System and method for detecting proximity between mobile device users
US20040266457A1 (en) * 1997-08-20 2004-12-30 Dupray Dennis J. Wireless location gateway and applications therefor
US20050003831A1 (en) * 1999-01-08 2005-01-06 Anderson Robert J. Monitoring of call information in a wireless location system
US20050015307A1 (en) * 2003-04-28 2005-01-20 Simpson Todd Garrett Method and system of providing location sensitive business information to customers
US6906643B2 (en) * 2003-04-30 2005-06-14 Hewlett-Packard Development Company, L.P. Systems and methods of viewing, modifying, and interacting with “path-enhanced” multimedia
US7071842B1 (en) * 2002-06-27 2006-07-04 Earthcomber, Llc System and method for locating and notifying a user of a person, place or thing having attributes matching the user's stated preferences
US20060200492A1 (en) * 2004-08-31 2006-09-07 Mario Villena Automatic evaluation system using specialized communications interfaces
US20070005373A1 (en) * 2004-08-31 2007-01-04 Villena Mario A Computerized agent and systems for automatic searching of properties having favorable attributes
US20080133716A1 (en) * 1996-12-16 2008-06-05 Rao Sunil K Matching network system for mobile devices
US8102253B1 (en) * 2002-06-27 2012-01-24 Earthcomber, Llc System and method for notifying a user of people, places or things having attributes matching a user's stated preference

Patent Citations (84)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5956397A (en) * 1993-02-22 1999-09-21 Murex Securities, Ltd. Automatic routing and information system for telephonic services
US5848373A (en) * 1994-06-24 1998-12-08 Delorme Publishing Company Computer aided map location system
US6326918B1 (en) 1995-06-06 2001-12-04 Wayport, Inc. Method and apparatus for geographic-based communications service
US6347230B2 (en) 1995-07-25 2002-02-12 Ace K Computer Co., Ltd. Position display system of mobile terminal
US6202023B1 (en) 1996-08-22 2001-03-13 Go2 Systems, Inc. Internet based geographic location referencing system and method
US20040139049A1 (en) * 1996-08-22 2004-07-15 Wgrs Licensing Company, Llc Unified geographic database and method of creating, maintaining and using the same
US6339744B1 (en) 1996-08-22 2002-01-15 Go2 Systems, Inc. Geographic location referencing system and method
US5839088A (en) 1996-08-22 1998-11-17 Go2 Software, Inc. Geographic location referencing system and method
US6223122B1 (en) 1996-08-22 2001-04-24 Go2 Systems, Inc. Geographic location referencing system and method
US6047236A (en) 1996-08-22 2000-04-04 Go2 Software, Inc. Geographic location referencing system and method
US6266612B1 (en) 1996-10-24 2001-07-24 Trimble Navigation Limited Position based personal digital assistant
US5974419A (en) * 1996-10-25 1999-10-26 Navigation Technologies Corporation Parcelization of geographic data for storage and use in a navigation application
US5968109A (en) * 1996-10-25 1999-10-19 Navigation Technologies Corporation System and method for use and storage of geographic data on physical media
US20080133716A1 (en) * 1996-12-16 2008-06-05 Rao Sunil K Matching network system for mobile devices
US6175831B1 (en) 1997-01-17 2001-01-16 Six Degrees, Inc. Method and apparatus for constructing a networking database and system
US5950200A (en) 1997-01-24 1999-09-07 Gil S. Sudai Method and apparatus for detection of reciprocal interests or feelings and subsequent notification
US6401039B1 (en) * 1997-02-10 2002-06-04 Baron Services, Inc. System and method for projecting storms using NEXRAD attributes
US6370510B1 (en) 1997-05-08 2002-04-09 Careerbuilder, Inc. Employment recruiting system and method using a computer network for posting job openings and which provides for automatic periodic searching of the posted job openings
US5978768A (en) * 1997-05-08 1999-11-02 Mcgovern; Robert J. Computerized job search system and method for posting and searching job openings via a computer network
US6249282B1 (en) 1997-06-13 2001-06-19 Tele-Publishing, Inc. Method and apparatus for matching registered profiles
US6052122A (en) 1997-06-13 2000-04-18 Tele-Publishing, Inc. Method and apparatus for matching registered profiles
US6073105A (en) 1997-06-13 2000-06-06 Tele-Publishing, Inc. Interactive personals online network method and apparatus
US6061681A (en) 1997-06-30 2000-05-09 Movo Media, Inc. On-line dating service for locating and matching people based on user-selected search criteria
US5963951A (en) * 1997-06-30 1999-10-05 Movo Media, Inc. Computerized on-line dating service for searching and matching people
US6370513B1 (en) 1997-08-08 2002-04-09 Parasoft Corporation Method and apparatus for automated selection, organization, and recommendation of items
US20040066330A1 (en) * 1997-08-19 2004-04-08 Siemens Automotive Corporation, A Delaware Corporation Vehicle information system
US20040104842A1 (en) * 1997-08-19 2004-06-03 Siemens Vdo Automotive Corporation, A Delaware Corporation Driver information system
US20040266457A1 (en) * 1997-08-20 2004-12-30 Dupray Dennis J. Wireless location gateway and applications therefor
US6269369B1 (en) 1997-11-02 2001-07-31 Amazon.Com Holdings, Inc. Networked personal contact manager
US6014090A (en) 1997-12-22 2000-01-11 At&T Corp. Method and apparatus for delivering local information to travelers
US6370566B2 (en) 1998-04-10 2002-04-09 Microsoft Corporation Generating meeting requests and group scheduling from a mobile device
US6324541B1 (en) 1998-06-11 2001-11-27 Boardwalk Ltd. System, method, and computer program product for providing relational patterns between entities
US6073138A (en) 1998-06-11 2000-06-06 Boardwalk A.G. System, method, and computer program product for providing relational patterns between entities
US6349290B1 (en) 1998-06-30 2002-02-19 Citibank, N.A. Automated system and method for customized and personalized presentation of products and services of a financial institution
US6343274B1 (en) 1998-09-11 2002-01-29 Hewlett-Packard Apparatus and method for merchant-to-consumer advertisement communication system
US6701307B2 (en) * 1998-10-28 2004-03-02 Microsoft Corporation Method and apparatus of expanding web searching capabilities
US6363427B1 (en) 1998-12-18 2002-03-26 Intel Corporation Method and apparatus for a bulletin board system
US6366962B1 (en) 1998-12-18 2002-04-02 Intel Corporation Method and apparatus for a buddy list
US20020054082A1 (en) * 1999-01-02 2002-05-09 Karpf Ronald S. System and method for providing accurate geocoding of responses to location questions in a computer assisted self interview
US20050003831A1 (en) * 1999-01-08 2005-01-06 Anderson Robert J. Monitoring of call information in a wireless location system
US6360167B1 (en) 1999-01-29 2002-03-19 Magellan Dis, Inc. Vehicle navigation system with location-based multi-media annotation
US6381603B1 (en) 1999-02-22 2002-04-30 Position Iq, Inc. System and method for accessing local information by using referencing position system
US6353785B1 (en) 1999-03-12 2002-03-05 Navagation Technologies Corp. Method and system for an in-vehicle computer architecture
US6349257B1 (en) 1999-09-15 2002-02-19 International Business Machines Corporation System for personalized mobile navigation information
US6741188B1 (en) 1999-10-22 2004-05-25 John M. Miller System for dynamically pushing information to a user utilizing global positioning system
US6343317B1 (en) 1999-12-29 2002-01-29 Harry A. Glorikian Internet system for connecting client-travelers with geographically-associated data
US6408309B1 (en) 2000-02-23 2002-06-18 Dinesh Agarwal Method and system for creating an interactive virtual community of famous people
US20040110515A1 (en) * 2000-02-29 2004-06-10 Blumberg Brad W. System and method for providing information based on geographic position
US20030074471A1 (en) * 2000-04-03 2003-04-17 Mark Anderson Method and apparatus for estimating a geographic location of a networked entity
US20040078489A1 (en) * 2000-04-03 2004-04-22 Mark Anderson Method and system to associate a geographic location information with a network address using a combination of automated and manual process
US7072963B2 (en) * 2000-04-03 2006-07-04 Quova, Inc. Method and system to modify geolocation activities based on logged query information
US20040068582A1 (en) * 2000-04-03 2004-04-08 Mark Anderson Method and system to initiate geolocation activities on demand and responsive to receipt of a query
US20030063072A1 (en) * 2000-04-04 2003-04-03 Brandenberg Carl Brock Method and apparatus for scheduling presentation of digital content on a personal communication device
US20040076279A1 (en) * 2000-05-16 2004-04-22 John Taschereau Method and system for providing geographically targeted information and advertising
US6339397B1 (en) 2000-06-01 2002-01-15 Lat-Lon, Llc Portable self-contained tracking unit and GPS tracking system
US20020086676A1 (en) 2000-06-10 2002-07-04 Hendrey Geoffrey R. Method and system for connecting mobile users based on degree of separation
US6542748B2 (en) 2000-06-10 2003-04-01 Telcontar Method and system for automatically initiating a telecommunications connection based on distance
US20020123934A1 (en) * 2000-07-07 2002-09-05 Tanaka Hirohisa A. Method and apparatus for location-sensitive, subsidized cell phone billing
US6356838B1 (en) 2000-07-25 2002-03-12 Sunil Paul System and method for determining an efficient transportation route
US6735568B1 (en) 2000-08-10 2004-05-11 Eharmony.Com Method and system for identifying people who are likely to have a successful relationship
US6618593B1 (en) 2000-09-08 2003-09-09 Rovingradar, Inc. Location dependent user matching system
US6356812B1 (en) 2000-09-14 2002-03-12 International Business Machines Corporation Method and apparatus for displaying information in a vehicle
US6374177B1 (en) 2000-09-20 2002-04-16 Motorola, Inc. Method and apparatus for providing navigational services in a wireless communication device
US20040064334A1 (en) * 2000-10-10 2004-04-01 Geosign Corporation Method and apparatus for providing geographically authenticated electronic documents
US20020051540A1 (en) * 2000-10-30 2002-05-02 Glick Barry J. Cryptographic system and method for geolocking and securing digital information
US20020151315A1 (en) * 2000-12-13 2002-10-17 Gravitate, Inc. Managing and querying moving point data
US7010308B2 (en) * 2000-12-13 2006-03-07 Telcontar Managing and querying moving point data
US20030069693A1 (en) * 2001-01-16 2003-04-10 Snapp Douglas N. Geographic pointing device
US20020106066A1 (en) * 2001-02-05 2002-08-08 Onepub.Com System and methods for providing anonymous telephone communications
US20040077359A1 (en) 2001-02-08 2004-04-22 Anette Bernas Method and apparatus for providing position profiles in mobile value-added services
US6505121B1 (en) 2001-08-01 2003-01-07 Hewlett-Packard Company Onboard vehicle navigation system
US20030154194A1 (en) 2001-12-28 2003-08-14 Jonas Jeffrey James Real time data warehousing
US20040117358A1 (en) * 2002-03-16 2004-06-17 Von Kaenel Tim A. Method, system, and program for an improved enterprise spatial system
US7071842B1 (en) * 2002-06-27 2006-07-04 Earthcomber, Llc System and method for locating and notifying a user of a person, place or thing having attributes matching the user's stated preferences
US7876215B1 (en) 2002-06-27 2011-01-25 Earthcomber, Llc System and method for locating and notifying a mobile user of people having attributes or interests matching a stated preference
US8102253B1 (en) * 2002-06-27 2012-01-24 Earthcomber, Llc System and method for notifying a user of people, places or things having attributes matching a user's stated preference
US20040034601A1 (en) 2002-08-16 2004-02-19 Erwin Kreuzer System and method for content distribution and reselling
US20040144301A1 (en) 2003-01-24 2004-07-29 Neudeck Philip G. Method for growth of bulk crystals by vapor phase epitaxy
US20040148275A1 (en) 2003-01-29 2004-07-29 Dimitris Achlioptas System and method for employing social networks for information discovery
US20040198398A1 (en) * 2003-04-01 2004-10-07 International Business Machines Corporation System and method for detecting proximity between mobile device users
US20050015307A1 (en) * 2003-04-28 2005-01-20 Simpson Todd Garrett Method and system of providing location sensitive business information to customers
US6906643B2 (en) * 2003-04-30 2005-06-14 Hewlett-Packard Development Company, L.P. Systems and methods of viewing, modifying, and interacting with “path-enhanced” multimedia
US20060200492A1 (en) * 2004-08-31 2006-09-07 Mario Villena Automatic evaluation system using specialized communications interfaces
US20070005373A1 (en) * 2004-08-31 2007-01-04 Villena Mario A Computerized agent and systems for automatic searching of properties having favorable attributes

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
"MySQL Reference Manual", , §§ 19.1 and 19.6 (2004).
"MySQL Reference Manual", <http://dev.mysql.com/doc/mysql/en/index.html>, §§ 19.1 and 19.6 (2004).
U.S. Appl. No. 10/462,142, filed Jun. 16, 2003, Abrams.
U.S. Appl. No. 10/854,054, filed May 26, 2004, Galbreath et al.
U.S. Appl. No. 10/854,057, filed May 26, 2004, Galbreath et al.

Also Published As

Publication number Publication date
US20060058958A1 (en) 2006-03-16
US7606687B2 (en) 2009-10-20

Similar Documents

Publication Publication Date Title
USRE44876E1 (en) Proximity search methods using tiles to represent geographical zones
US10571288B2 (en) Searching similar trajectories by locations
US7634465B2 (en) Indexing and caching strategy for local queries
KR101579032B1 (en) Labeling visited locations based on contact information
US8538973B1 (en) Directions-based ranking of places returned by local search queries
US8024314B2 (en) Hybrid location and keyword index
CN107092638B (en) Method and computing device for providing relevant element information from map history based on position
JP5798661B2 (en) Refined location estimation and inverse geocoding based on user profile
US20160232179A1 (en) Recommending points of interests in a region
US8489625B2 (en) Mobile query suggestions with time-location awareness
US7619913B2 (en) Device, method and program for managing area information
US9940381B1 (en) Managing information about entities using observations
US8015172B1 (en) Method of conducting searches on the internet to obtain selected information on local entities and provide for searching the data in a way that lists local businesses at the top of the results
US9747304B2 (en) Approximating a user location
Hashem et al. Efficient computation of trips with friends and families
US11049199B2 (en) Contextual trip itinerary generator
CN107092623B (en) Interest point query method and device
US20170308560A1 (en) Location Searching with Category Indices
CN109977324B (en) Interest point mining method and system
CN108932347A (en) A kind of spatial key querying method based on society&#39;s perception under distributed environment
US8706732B1 (en) Managing information about entities using clusters of received observations
Drosatos et al. Pythia: A privacy-enhanced personalized contextual suggestion system for tourism
Ge et al. MPG: not so random exploration of a city
CN112883272B (en) Method for determining recommended object
CN115329221B (en) Query method and query system for multi-source geographic entity

Legal Events

Date Code Title Description
FPAY Fee payment

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12

AS Assignment

Owner name: META PLATFORMS, INC., CALIFORNIA

Free format text: CHANGE OF NAME;ASSIGNOR:FACEBOOK, INC.;REEL/FRAME:058553/0802

Effective date: 20211028