SPATIAL-TEMPORAL STORAGE SYSTEM, METHOD, AND RECORDING MEDIUM

• US 20170262469A1
• Filed: 03/08/2016
• Published: 09/14/2017
• Est. Priority Date: 03/08/2016
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ganti, Raghu Kiran, Li, Shen, Srivatsa, Mudhakar
• Granted Patent: US 10,108,637 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/1844 Management specifically adapted to replicated file systems
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/2264 Multidimensional index structures
• CPC Class Codes: G06F 16/2452 Query translation
• CPC Class Codes: G06F 16/2453 Query optimisation
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: G06F 16/275 Synchronous replication
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Abstract

A spatial-temporal storage method, system, and non-transitory computer readable medium, include, in a first layer, a geometric translation circuit configured to split spatial-temporal information into row keys and translate a geometry query into a range scan, and a multi-scan optimization circuit configured to compute an optimal read strategy to optimize the range scan translated by the geometric translation circuit into a series of block starting offsets and block sizes, and, in a second layer, a block grouping circuit configured to allow grouping of blocks in the second layer while preserving spatial data locality when splits of spatial-temporal information occur in the first layer.

Claims

1. A spatial-temporal storage system, comprising:

in a first layer,

a geometric translation circuit configured to split spatial-temporal information into row keys and translate a geometry query into a range scan; and

a multi-scan optimization circuit configured to compute an optimal read strategy to optimize the range scan translated by the geometric translation circuit into a series of block starting offsets and block sizes; and

in a second layer,

a block grouping circuit configured to allow grouping of blocks in the second layer while preserving spatial data locality when splits of spatial-temporal information occur in the first layer.

2. The system of claim 1, wherein, in the second layer, the block grouping circuit groups spatial-temporal information such that data corresponding to a first group in a first server is replicated to create a replica and the replica is placed in a second group in a second server.

3. The system of claim 1, further comprising, in the first layer, a deteimination circuit configured to determine if the optimal read strategy is greater than a predetermined threshold.

4. The system of claim 1, wherein the block grouping circuit specifies replica groups when writing data into the second layer, and

wherein replicas in a same group are placed into a same data node.

5. The system of claim 4, wherein block sizes are made by the multi-scan optimization circuit to respect splits such that a daughter region server is moved into a remote physical server.

6. The system of claim 1, wherein the block grouping circuit groups the blocks by replicating the blocks a predetermined number of times according to a predefined number of spit keys within a given region.

7. The system of claim 1, wherein the spatial-temporal information is split so as to have uniform density in a first server and a second server.

8. A non-transitory computer-readable recording medium recording a spatial-temporal storage program, the program causing a computer to perform:

in a first layer,

splitting spatial-temporal information into row keys and translating a geometry query into a range scan; and

computing an optimal read strategy to optimize the range scan translated by the translating into a series of block starting offsets and block sizes; and

in a second layer,

grouping of blocks in the second layer while preserving spatial data locality when splits of spatial-temporal information occur in the first layer.

9. The non-transitory computer-readable recording medium of claim 8, wherein, in the second layer, the grouping groups spatial-temporal information such that data corresponding to a first group in a first server is replicated to create a replica and the replica is placed in a second group in a second server.

10. The non-transitory computer-readable recording medium of claim 8, further comprising, in the first layer, determining if the optimal read strategy is greater than a predetermined threshold.

11. The non-transitory computer-readable recording medium of claim 8, wherein the grouping specifies replica groups when writing data into the second layer, and

wherein replicas in a same group are placed into a same data node.

12. The non-transitory computer-readable recording medium of claim 11, wherein block sizes are made by the computing to respect splits such that a daughter region server is moved into a remote physical server.

13. The non-transitory computer-readable recording medium of claim 8, wherein the grouping groups the blocks by replicating the blocks a predetermined number of times according to a predefined number of spit keys within a given region.

14. A spatial-temporal storage method, comprising:

in a first layer,

splitting spatial-temporal information into row keys and translating a geometry query into a range scan; and

computing an optimal read strategy to optimize the range scan translated by the translating into a series of block starting offsets and block sizes; and

in a second layer,

grouping of blocks in the second layer while preserving spatial data locality when splits of spatial-temporal information occur in the first layer.

15. The method of claim 14, wherein, in the second layer, the grouping groups spatial-temporal information such that data corresponding to a first group in a first server is replicated to create a replica and the replica is placed in a second group in a second server.

16. The method of claim 14, further comprising, in the first layer, determining if the optimal read strategy is greater than a predetermined threshold.

17. The method of claim 14, wherein the grouping specifies replica groups when writing data into the second layer, and

wherein replicas in a same group are placed into a same data node.

18. The method of claim 17, wherein block sizes are made by the computing to respect splits such that a daughter region server is moved into a remote physical server.

19. The method of claim 14, wherein the grouping groups the blocks by replicating the blocks a predetermined number of times according to a predefined number of spit keys within a given region.

20. The method of claim 14, wherein, the spatial-temporal information is split so as to have uniform density in a first server and a second server.