APPARATUS, SYSTEMS, AND METHODS FOR PROVIDING LOCATION INFORMATION

• US 20190220447A1
• Filed: 03/27/2019
• Published: 07/18/2019
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: Foursquare Labs, Inc.
• Original Assignee: Factual Incorporated (Foursquare Labs, Inc.)
• Inventors: Rana, Ahad, Shimanovsky, Boris
• Granted Patent: US 10,459,896 B2
• Time in Patent Office: Days
• CPC Class Codes: G05B 13/0265 the criterion being a learning criterion
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06F 16/235 Update request formulation
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/2386 Bulk updating operations data conversion details G06F16/258
• CPC Class Codes: G06F 16/24564 Applying rules; Deductive queries
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/337 Profile generation, learning or modification
• CPC Class Codes: G06F 16/35 Clustering; Classification
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06N 20/00 Machine learning
• CPC Class Codes: G06N 5/022 Knowledge engineering; Knowledge acquisition
• CPC Class Codes: G06Q 10/101 Collaborative creation, e.g. joint development of products or services
• CPC Class Codes: G06Q 30/0261 based on user location
• CPC Class Codes: G06Q 30/0282 Rating or review of business operators or products
• CPC Class Codes: G06Q 50/01 : Social networking
• CPC Class Codes: H04L 41/14 : Network analysis or design
• CPC Class Codes: H04W 16/00 : Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
• CPC Class Codes: H04W 16/24 : Cell structures
• CPC Class Codes: H04W 16/30 : Special cell shapes, e.g. doughnuts or ring cells
• CPC Class Codes: H04W 16/32 : Hierarchical cell structures
• CPC Class Codes: H04W 4/02 : Services making use of location information
• CPC Class Codes: H04W 4/021 : Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
• CPC Class Codes: H04W 4/025 : using location based information parameters
• CPC Class Codes: H04W 4/029 : Location-based management or tracking services
• CPC Class Codes: H04W 4/50 : Service provisioning or reconfiguring
• CPC Class Codes: H04W 64/00 : Locating users or terminals or network equipment for network management purposes, e.g. mobility management
• CPC Class Codes: H04W 64/003 : locating network equipment
• CPC Class Codes: H04W 76/38 : triggered by timers
• CPC Class Codes: H04W 8/08 : Mobility data transfer
• CPC Class Codes: H04W 8/16 : selectively restricting mobility data tracking
• CPC Class Codes: H04W 8/18 : Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
• CPC Class Codes: H04W 88/00 : Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
• CPC Class Codes: H04W 88/02 : Terminal devices

Abstract

The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.

Claims

1. An apparatus comprising:

a memory device to store a master index system that identifies sub-polygons in a geographical region; and

a processor and non-volatile memory comprising a set of computer-readable instructions, wherein the processor is configured to execute the computer readable instructions to;

identify a region of interest associated with a target location determined from a location identifier;

retrieve from the master index system an index system corresponding to the identified region of interest;

determine a query identifier corresponding to a location identifier;

compare one or more bits in the query identifier with bits in the index system to determine that the query identifier is represented in the index system, wherein the step of comparing includes;

comparing a first set of bits of the one or more bits in the query identifier, corresponding to a lower-precision sub-polygon, to the bits in the index system, corresponding to sub-polygons in the region of interest;

comparing a second set of bits of the one or more bits in the query identifier, corresponding to a higher-precision sub-polygon, to the bits in the index system, corresponding to the sub-polygons in the region of interest; and

determine whether the target location corresponds to one or more of the sub-polygons within the region of interest,

wherein the master index system comprises a plurality of index systems of unique identifiers corresponding to the sub-polygons of the region of interest.

2. The apparatus of claim 1, wherein the identifiers are based on a hierarchical encoding scheme.

3. The apparatus of claim 1, wherein the index system comprises an index tree, and in response to the first set of bits of the one or more bits in the query identifier matches a first index of the index system corresponding to a leaf node of the index tree, the processor determines whether the query identifier is within the region of interest.

4. The apparatus of claim 1, wherein the processor is further configured to process a polygon identifier associated with the query identifier and retrieved from the index system, determine a group identifier associated with the polygon identifier, and provide a service associated with the group identifier to a client device over a communication network.

5. The apparatus of claim 1, wherein the processor is further configured to process a polygon identifier associated with the query identifier and retrieved from the index system, and initiate transmission of information associated with the polygon identifier to a client device over a communication network.

6. The apparatus of claim 1, wherein the processor is further configured to perform the step of comparing the first set of bits of the one or more bits in the query identifier to the bits in the index system before the step of comparing the second set of bits of the one or more bits in the query identifier to the bits in the index system.

7. The apparatus of claim 1, wherein the processor is further configured to provide a service associated with the region of interest to a client device over a communication network after determining that the location identifier provided by the client device is within the region of interest.

8. The apparatus of claim 1, wherein the location identifier is associated with a client device'"'"'s location and the location identifier is received from the client device.

9. A computer-implemented method comprising:

identifying a region of interest associated with a target location determined from a location identifier;

retrieving from a master index system that identifies sub-polygons in a geographical region, an index system corresponding to the identified region of interest;

determining a query identifier corresponding to the location identifier;

comparing one or more bits in the query identifier with bits in the index system to determine that the query identifier is represented in the index system, wherein the step of comparing includes;

comparing a first set of bits of the one or more bits in the query identifier, corresponding to a lower-precision sub-polygon, to the bits in the index system, corresponding sub-polygons in the region of interest;

comparing a second set of bits of the one or more bits in the query identifier, corresponding to a higher-precision sub-polygon, to the bits in the index system, corresponding the sub-polygons in the region of interest; and

determining whether the target location corresponds to one or more of the sub-polygons within the region of interest,

wherein the master index system comprises a plurality of index systems of unique identifiers corresponding to the sub-polygons of the region of interest.

10. The method of claim 9, wherein the identifiers are based on a hierarchical encoding scheme.

11. The method of claim 9, wherein the index system comprises an index tree, and in response to determining that the first set of bits of the one or more bits in the query identifier matching a first index of the index system corresponding to a leaf node of the index tree, determining whether the query identifier is within the region of interest.

12. The method of claim 9, further comprising processing a polygon identifier associated with the query identifier and retrieved from the index system, determining a group identifier associated with the polygon identifier, and providing a service associated with the group identifier to a client device over a communication network.

13. The method of claim 9, further comprising processing a polygon identifier associated with the query identifier and retrieved from the index system, and initiating transmission of information associated with the polygon identifier to a client device over a communication network.

14. The method of claim 9, further comprising performing the step of comparing the first set of bits of the one or more bits in the query identifier to the bits in the index system before the step of comparing the second set of bits of the one or more bits in the query identifier to the bits in the index system.

15. The method of claim 9, further comprising providing a service associated with the region of interest to a client device over a communication network after determining that the location identifier provided by the client device is within the region of interest.

16. The method of claim 9, wherein the location identifier is associated with a client device'"'"'s location and the location identifier is received from the client device.

17. A non-transitory computer readable medium having instructions executable by a data processing apparatus to:

identify a region of interest associated with a target location determined from a location identifier;

retrieve from a master index system that identifies sub-polygons in a geographical region, an index system corresponding to the identified region of interest;

determine a query identifier corresponding to a location identifier;

compare one or more bits in the query identifier with bits in the index system to determine that the query identifier is represented in the index system, wherein the step of comparing includes;

comparing a first set of bits of the one or more bits in the query identifier, corresponding to a lower-precision sub-polygon, to the bits in the index system, corresponding to sub-polygons in the region of interest;

comparing a second set of bits of the one or more bits in the query identifier, corresponding to a higher-precision sub-polygon, to the bits in the index system, corresponding to the sub-polygons in the region of interest; and

determine whether the target location corresponds to one or more of the sub-polygons within the region of interest,

wherein the master index system comprises a plurality of index systems of unique identifiers corresponding to the sub-polygons of the region of interest.

18. The medium of claim 17, wherein the instructions are further executable by the data processing apparatus to provide a service associated with the region of interest to a client device over a communication network after determining that the location identifier is within the region of interest.

19. The medium of claim 17, wherein the identifiers are based on a hierarchical encoding scheme.

20. The medium of claim 17, wherein the index system comprises an index tree, and in response to determining that the first set of bits of the one or more bits in the query identifier matching a first index of the index system corresponding to a leaf node of the index tree, the instructions are further executable by the data processing apparatus to determine whether the query identifier is within the region of interest.

21. The medium of claim 17, wherein the instructions are further executable by the data processing apparatus to process a polygon identifier associated with the query identifier and retrieved from the index system, determine a group identifier associated with the polygon identifier, and provide a service associated with the group identifier to a client device over a communication network.

22. The medium of claim 17, wherein the instructions are further executable by the data processing apparatus to process a polygon identifier associated with the query identifier and retrieved from the index system, and initiate transmission of information associated with the polygon identifier to a client device over a communication network.

23. The medium of claim 17, wherein the instructions are further executable by the data processing apparatus to perform the step of comparing the first set of bits of the one or more bits in the query identifier to the bits in the index system before the step of comparing the second set of bits of the one or more bits in the query identifier to the bits in the index system.

24. The medium of claim 17, wherein the index system comprises an index tree having a branch node and a leaf node, the branch node is associated with a geographic area that is larger than that of the leaf node, and the instructions are further executable by the data processing apparatus to traverse the index tree from the branch node to the leaf node.

25. The medium of claim 17, wherein the instructions are further executable by the data processing apparatus to provide a service associated with the region of interest to a client device over a communication network after determining that the location identifier provided by the client device is within the region of interest.

26. The medium of claim 17, wherein the location identifier is associated with a client device'"'"'s location and the location identifier is received from the client device.