ENHANCED GEOSPATIAL DATA RESOLVER
A server computer system receives handles a client request. The system determines a set of geographical coordinates associated with the request, and uses this coordinates as input into a traversable tree to determine a polygon identifier. The polygon identifier uniquely corresponds to and identifies one of second set of polygons that are non-overlapping versions of first set of polygons that are overlapping. The server computing system transmits a set of parameters that are associated with the one of the second set of polygons that corresponds to the polygon identifier retrieved through the traversable tree.
1 . A method performed by a data processing system, comprising:
receiving a request over a computer network;
in response to receiving the request over the computer network, determining a set of geographical coordinates associated with the request;
applying as input into a traversable tree, the set of geographical coordinates associated with the request, to determine a polygon identifier, wherein the polygon identifier corresponds to one of a second set of polygons that are non-overlapping, the second set of polygons being generated based on a first set of polygons that are overlapping; and
transmitting over the computer network, one of second parameter sets associated with one of the second set of polygons that corresponds to the corresponding polygon identifier.
2 . The method of claim 1 , further comprising:
prior to receiving the request,
generating the second set of polygons based on the first set of polygons, comprising:
decoding data files to extract the first set of polygons, wherein each of the data files encodes geographic information, and
generating the second set of polygons according to the first set of polygons being arranged on a common reference plane.
3 . The method of claim 2 , wherein each of the second set of polygons are uniquely associated with the corresponding polygon identifier and a corresponding one of the second parameter sets, wherein each of the first set of polygons comprise boundaries of a respective geographical area, wherein at least two or more of the first set of polygons overlap and each of the first set of polygons are associated with a corresponding one of a first parameter sets, and wherein the second parameter sets comprise a combined version of the first parameter sets where the first set of polygons are overlapping.
4 . The method of claim 1 , further comprising:
prior to receiving the request,
generating the traversable tree based on the second set of polygons that are non-overlapping, comprising:
building the traversable tree with a plurality of nodes, each of the plurality of nodes corresponding to a bound area that bounds at least one of the second set of polygons,
branching the plurality of nodes in the traversable tree based on nesting of the bound area relative to other bound areas, and
configuring the traversable tree to output the corresponding polygon identifier that is associated with one of the second set of polygons that the set of geographical coordinates resides in.
5 . The method of claim 4 , further comprising:
prior to receiving the request, loading the traversable tree in local memory of the data processing system.
6 . The method of claim 4 , wherein each leaf node of the traversable tree corresponds to one of the second set of polygons.
7 . The method of claim 4 , wherein generating the traversable tree comprises generating each of the plurality of nodes with a valid time window, and traversing the traversable tree comprises filtering the traversable tree to ignore each of the plurality of nodes that are expired according to time specified in the request and the valid time window.
8 . The method of claim 1 , further comprising:
updating the second set of polygons in response to a change in shape, size, or location of the first set of polygons.
9 . The method of claim 8 , wherein updating the second set of polygons comprises:
generating new second set of polygons based on the change to the first set of polygons, and
storing, in memory, a subset of the second set of polygons based on a difference between the second set of polygons and the new second set of polygons, wherein the traversable tree is updated based on the new second set of polygons.
10 . A server computer system comprising:
a memory, and one or more processors coupled with the memory configured to perform operations, comprising:
receiving a request over a computer network;
in response to receiving the request over the computer network, determining a set of geographical coordinates associated with the request;
applying as input into a traversable tree, the set of geographical coordinates associated with the request, to determine a polygon identifier, wherein the polygon identifier corresponds to one of second set of polygons that are non-overlapping, the second set of polygons being generated based on first set of polygons that are overlapping; and
transmitting over the computer network, one of second parameter sets associated with one of the second set of polygons that corresponds to the corresponding polygon identifier.
11 . The server computer system of claim 10 , wherein the operations further comprise:
prior to receiving the request,
generating the second set of polygons based on the first set of polygons, comprising:
decoding data files to extract the first set of polygons, wherein each of the data files encodes geographic information, and
generating the second set of polygons according to the first set of polygons being arranged on a common reference plane.
12 . The server computer system of claim 11 , wherein each of the second set of polygons are uniquely associated with the corresponding polygon identifier and a corresponding one of the second parameter sets, wherein each of the first set of polygons comprise boundaries of a respective geographical area, wherein at least two or more of the first set of polygons overlap and each of the first set of polygons are associated with a corresponding one of first parameter sets, and wherein the second parameter sets comprise a combined version of the first parameter sets where the first set of polygons are overlapping.
13 . The server computer system of claim 10 , wherein the operations further comprise:
prior to receiving the request,
generating the traversable tree based on the second set of polygons that are non-overlapping, comprising:
building the traversable tree with a plurality of nodes, each of the plurality of nodes corresponding to a bound area that bounds at least one of the second set of polygons,
branching the plurality of nodes in the traversable tree based on nesting of the bound area relative to other bound areas, and
configuring the traversable tree to output the corresponding polygon identifier that is associated with one of the second set of polygons that the set of geographical coordinates resides in.
14 . The server computer system of claim 13 , wherein the operations further comprise:
prior to receiving the request, loading the traversable tree in local memory.
15 . The server computer system of claim 13 , wherein the traversable tree comprises an R-tree, and wherein each leaf node of the traversable tree corresponds to one of the second set of polygons.
16 . A non-transitory computer readable storage medium storing instructions, which when executed by a computer processing system, causes the computer processing system to perform operations comprising:
receiving a request over a computer network;
in response to receiving the request over the computer network, determining a set of geographical coordinates associated with the request;
applying as input into a traversable tree, the set of geographical coordinates associated with the request, to determine a polygon identifier, wherein the polygon identifier corresponds to one of second set of polygons that are non-overlapping, the second set of polygons being generated based on first set of polygons that are overlapping; and
transmitting over the computer network, one of second parameter sets associated with one of the second set of polygons that corresponds to the corresponding polygon identifier.
17 . The non-transitory computer readable storage medium of claim 16 , wherein the operations further comprise:
prior to receiving the request,
generating the second set of polygons based on the first set of polygons, comprising:
decoding data files to extract the first set of polygons, wherein each of the data files encodes geographic information, and
generating the second set of polygons according to the first set of polygons being arranged on a common reference plane.
18 . The non-transitory computer readable storage medium of claim 17 , wherein each of the second set of polygons are uniquely associated with the corresponding polygon identifier and a corresponding one of the second parameter sets, wherein each of the first set of polygons comprise boundaries of a respective geographical area, wherein at least two or more of the first set of polygons overlap and each of the first set of polygons are associated with a corresponding one of first parameter sets, and wherein the second parameter sets comprise a combined version of the first parameter sets where the first set of polygons are overlapping.
19 . The non-transitory computer readable storage medium of claim 16 , wherein the operations further comprise:
prior to receiving the request,
generating the traversable tree based on the second set of polygons that are non-overlapping, comprising:
building the traversable tree with a plurality of nodes, each of the plurality of nodes corresponding to a bound area that bounds at least one of the second set of polygons,
branching the plurality of nodes in the traversable tree based on nesting of the bound area relative to other bound areas, and
configuring the traversable tree to output the corresponding polygon identifier that is associated with one of the second set of polygons that the set of geographical coordinates resides in.
20 . The non-transitory computer readable storage medium of claim 19 , wherein the operations further comprise:
prior to receiving the request, loading the traversable tree in local memory.