Data processing system using geographical locations

• US RE45,750 E1
• Filed: 08/20/2014
• Issued: 10/13/2015
• Est. Priority Date: 07/09/2009
• Status: Expired due to Fees

• Current Assignee: Movix Limited
• Original Assignee: Movix Limited
• Inventors: Morrison, Craig, Cockrill, Joel, Morris, Johnathan Jones, Spaull, Robert
• Primary Examiner(s): Wood, William H
• Application Number:
  US14/464,329
• Time in Patent Office: 419 Days
• Field of Search: 709/217, 709/224, 709/226
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24575 using context
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 17/30241 in geographical information databases instruments for geographical navigation G01C21/00; three dimensional geographic models G06T17/05
• CPC Class Codes: G06F 17/30528 using context

Abstract

A data processing system (1,2) stores coordinate data defining a plurality of unique regions (17), for example defined by a cell of a geodesic grid (13) applied to the surface of the earth (12). Each region can be allocated to an owner and there is stored a unique identifier for that region, a hierarchical descriptor for that region, data identifying the owner, and a network address which identifies an owner domain in respect of that region. An owner of a region may sub-allocate sub-regions (18) or objects of an allocated region and there is stored in respect of any sub-region or object that has been sub-allocated by an owner, an identifier and a hierarchical descriptor for that sub-region or object. The data processing system can resolve a descriptor based DNS query specifying a region, or a sub-region, or object of such a region, so as to return data comprising the network address for the owner domain allocated to that region.

Claims

1. A data processing method carried out on a data processing system, the system comprising a processor and a data storage device which stores coordinate data defining a plurality of unique geographical regions, each region being a cell of a geodesic grid applied to the surface of the earth;

wherein each region can be allocated to an owner and the method comprises allocating regions to respective owners and in respect of each allocated region, using the data storage device is configured to store, in respect of an that allocated region, a unique identifier for that region and a hierarchical descriptor for that region, data identifying the owner, and a network address which identifies an owner domain in respect of that region;

the method comprises sub-allocation by an owner of an allocated region of at least one of;

(i) a sub-region of the allocated region;

(ii) an object within the allocated region;

(ii) a sub-object of an object within the allocated region;

(iv) an object within a sub-region of the allocated region; and

(v) a sub-object of an object within a sub-region of the allocated region;

wherein regions and sub regions are defined using a grid of top level parent triangles each having a unique identifier, each top level parent triangle being repeatedly sub-divisible into four lower level triangles in a cascading parent/child relationship, wherein each lower level triangle has a unique identifier comprising the unique identifier of its parent triangle and an identifier to distinguish it from the other three children of that parent triangle;

the method comprises storing in the data storage, in respect of any sub-allocated sub-region, object or sub-object, an identifier and a hierarchical descriptor for that sub-region, object or sub-object;

and wherein the method comprises resolving a descriptor based DNS query specifying a region, so as to return data comprising the network address for the owner domain allocated to that region.

2. A data processing method as claimed in claim 1, wherein the method comprises resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the owner domain allocated to that region.

3. A data processing method as claimed in claim 1 wherein the method comprises storing, in the data storage device, in respect of any sub-allocated sub-region, object or sub-object, a network address which identifies a sub-owner domain in respect of that sub-allocated sub-region, object or sub-object, the method further comprising resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the sub-owner domain allocated thereto.

4. A data processing method as claimed in claim 2, wherein each region, sub-region, object or sub-object is associated with a unique descriptive, location based, uniform resource locator.

5. A data processing method as claimed in claim 1, wherein the top level parent triangles are arranged in groups of eight forming an octagon, each top level parent triangle in an octagon having a unique identifier which comprises a unique identifier for the octagon and an identifier to distinguish it from the other seven triangles in that octagon.

6. A data processing method as claimed in claim 1, wherein the method comprises storing sub-ownership data in the event that an owner of an allocated region enters into a sub-ownership transaction in respect of a sub-allocated sub-region, object or sub-object within an allocated region.

7. A data processing method carried out on a data processing system, the system comprising a processor and a data storage device which stores data defining a plurality of unique regions of a space, each region being a cell of a geodesic grid applied to the surface of the earth;

wherein each region can be allocated to an owner and the method comprises allocating regions to respective owners and in respect of each allocated region, using the data storage device to store, in respect of each allocated region, a unique identifier for that region and a hierarchical descriptor for that region, data identifying the owner, and a network address which identifies an owner domain in respect of that region;

the method comprises sub-allocation by an owner of an allocated region of at least one of;

(i) a sub-region of the allocated region;

(ii) an object within the allocated region;

(ii) a sub-object of an object within the allocated region;

(iv) an object within a sub-region of the allocated region; and

(v) a sub-object of an object within a sub-region of the allocated region;

wherein regions and sub regions are defined using a grid of top level parent triangles each having a unique identifier, each top level parent triangle being repeatedly sub-divisible into four lower level triangles in a cascading parent/child relationship, wherein each lower level triangle has a unique identifier comprising the unique identifier of its parent triangle and an identifier to distinguish it from the other three children of that parent triangle;

the method comprises storing in the data storage device, in respect of any sub-allocated sub-region, object or sub-object, an identifier and a hierarchical descriptor for that sub-region, object or sub-object;

and wherein the method comprises resolving a descriptor based DNS query specifying a region, so as to return data comprising the network address for the owner domain allocated to that region.

8. A data processing method as claimed in claim 7, wherein the method comprises resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the owner domain allocated to that region.

9. A data processing method as claimed in claim 7 wherein the method comprises storing, in the data storage device, in respect of any sub-allocated sub-region, object or sub-object, a network address which identifies a sub-owner domain in respect of that sub-allocated sub-region, object or sub-object, the method further comprising resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the sub-owner domain allocated thereto.

10. A data processing method as claimed in claim 8, wherein each region, sub-region, object or sub-object is associated with a unique descriptive, location based, uniform resource locator.

11. A data processing method as claimed in claim 7, wherein the data storage stores coordinate data defining the plurality of unique regions.

12. A data processing method as claimed in claim 7, wherein each region is a cell of a geodesic grid applied to the surface of the earth.

13. A data processing method as claimed in claim 7, wherein the space is a virtual environment.

14. A data processing method as claimed in claim 7, wherein the top level parent triangles are arranged in groups of eight forming an octagon, each top level parent triangle in an octagon having a unique identifier which comprises a unique identifier for the octagon and an identifier to distinguish it from the other seven triangles in that octagon.

15. A non-transitory computer program product comprising instructions which when carried out by a data processing apparatus comprising a data storage device and a processor, will cause the data processing apparatus to carry out a method comprising:

storing, in the data storage device, data defining a plurality of unique regions of a space, wherein each region is a cell of a geodesic grid applied to the surface of the earth;

allocating a region to an owner and storing, in the data storage device, a unique identifier for that region and a hierarchical descriptor for that region, data identifying the owner, and a network address which identifies an owner domain in respect of that region;

permitting sub-allocation by an owner of an allocated region of at least one of;

(i) a sub-region of the allocated region;

(ii) an object within the allocated region;

(ii) a sub-object of an object within the allocated region;

(iv) an object within a sub-region of the allocated region; and

(v) a sub-object of an object within a sub-region of the allocated region; and

storing, in the data storage device, in respect of any sub-allocated sub-region, object or sub-object, an identifier and a hierarchical descriptor for that sub-region, object or sub-object;

wherein regions and sub regions are defined using a grid of top level parent triangles each having a unique identifier, each top level parent triangle being repeatedly sub-divisible into four lower level triangles in a cascading parent/child relationship, wherein each lower level triangle has a unique identifier comprising the unique identifier of its parent triangle and an identifier to distinguish it from the other three children of that parent triangle;

and resolving a descriptor based DNS query specifying a region, so as to return data comprising the network address for the owner domain allocated to that region.

16. A non-transitory computer program product as claimed in claim 15, wherein the method comprises resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the owner domain allocated to that region.

17. A non-transitory computer program product as claimed in claim 15 wherein the method comprises storing in the data storage, in respect of any sub-allocated sub-region, object or sub-object, a network address which identifies a sub-owner domain in respect of that sub-allocated sub-region, object or sub-object, the method further comprising resolving a descriptor based DNS query specifying a sub-region, object or sub-object of a region, so as to return data comprising the network address for the sub-owner domain allocated thereto.

18. A non-transitory computer program product as claimed in claim 16, wherein each region, sub-region, object or sub-object is associated with a unique descriptive, location based, uniform resource locator.

19. A non-transitory computer program product as claimed in claim 15, wherein each region is a cell of a geodesic grid applied to the surface of the earth.

20. A non-transitory computer program product as claimed in claim 15, wherein the space is a virtual environment.

21. A non-transitory computer program product as claimed in claim 15 wherein the top level parent triangles are arranged in groups of eight forming an octagon, each top level parent triangle in an octagon having a unique identifier which comprises a unique identifier for the octagon and an identifier to distinguish it from the other seven triangles in that octagon.

22. A non-transitory computer program product as claimed in claim 15, wherein the data processing system stores sub-ownership data in the event that an owner of an allocated region enters into a sub-ownership transaction in respect of a sub-allocated sub-region, object or sub-object within an allocated region.