US11860846B2ActiveUtilityA1

Methods, systems and apparatus to improve spatial-temporal data management

66
Assignee: INTEL CORPPriority: Dec 22, 2016Filed: Apr 13, 2021Granted: Jan 2, 2024
Est. expiryDec 22, 2036(~10.5 yrs left)· nominal 20-yr term from priority
G06F 16/2264G06F 16/2246G06F 16/2365G06F 16/2477
66
PatentIndex Score
0
Cited by
26
References
21
Claims

Abstract

Methods, apparatus, systems and articles of manufacture are disclosed to improve spatial-temporal data management. An example apparatus includes a hypervoxel data structure generator to generate a root hexatree data structure having sixteen hypernodes, an octree manager to improve a spatiotemporal data access efficiency by generating a first degree of symmetry in the root hexatree, the octree manager to assign a first portion of the hypernodes to a positive temporal subspace and to assign a second portion of the hypernodes to a negative temporal subspace, and a quadtree manager to improve the spatiotemporal data access efficiency by generating a second degree of symmetry in the root hexatree, the quadtree manager to assign respective hypernodes of the positive temporal subspace and the negative temporal subspace to respective positive and negative spatial subspaces.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
       1. An apparatus comprising:
 memory; 
 instructions in the apparatus; and 
 processor circuitry to execute the instructions to at least:
 in response to a first determination that a write request associated with a spatio-temporal data structure includes a data point to be added to the spatio-temporal data structure, extract spatio-temporal data from the data point; 
 determine whether the spatio-temporal data is included in a boundary of a root node of the spatio-temporal data structure; and 
 at least one of expand the spatio-temporal data structure or insert the spatio-temporal data in the spatio-temporal data structure based on a second determination of whether the spatio-temporal data is included in the boundary. 
 
 
     
     
       2. The apparatus of  claim 1 , wherein the spatio-temporal data structure is a root hexatree data structure, and the processor circuitry is to execute the instructions to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive temporal subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative temporal subspace. 
 
     
     
       3. The apparatus of  claim 2 , wherein the processor circuitry is to execute the instructions to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive temporal subspaces with first temporal data greater than a temporal value associated with the hyperspace center; and 
 associate the respective negative temporal subspaces with second temporal data less than the temporal value associated with the hyperspace center. 
 
     
     
       4. The apparatus of  claim 1 , wherein the spatio-temporal data structure is a root hexatree data structure, and the processor circuitry is to execute the instructions to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive spatial subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative spatial subspace. 
 
     
     
       5. The apparatus of  claim 4 , wherein the processor circuitry is to execute the instructions to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive spatial subspaces with first spatial data greater than a spatial value associated with the hyperspace center; and 
 associate the respective negative spatial subspaces with second spatial data less than the spatial value associated with the hyperspace center. 
 
     
     
       6. The apparatus of  claim 1 , wherein the spatio-temporal data structure is a first hexatree data structure, and the processor circuitry is to execute the instructions to, in response to a third determination that the spatio-temporal data is not included in the boundary:
 determine an expansion direction for a second hexatree data structure to be associated with the first hexatree data structure; 
 generate at least one of a spatial offset value or a temporal offset value for a new location of the spatio-temporal data in the second hexatree data structure; 
 identify a hyperspace center point of the second hexatree data structure based on a space-time delta; and 
 associate the first hexatree data structure as a child node to the second hexatree data structure. 
 
     
     
       7. The apparatus of  claim 1 , wherein the processor circuitry is to execute the instructions to:
 receive the spatio-temporal data from an agent; and 
 in response to a third determination that the spatio-temporal data is included in the boundary:
 determine a storage location for metadata associated with the spatio-temporal data; 
 in response to a fourth determination that the storage location is local to the agent, store the metadata into storage of the agent; and 
 in response to a fifth determination that the storage location is in storage separate from the agent, store the metadata in a database or a networked cloud storage. 
 
 
     
     
       8. An apparatus comprising:
 spatial-temporal point analyzer hardware circuitry to:
 in response to a first determination that a write request associated with a spatio-temporal data structure includes a data point to be added to the spatio-temporal data structure, extract spatio-temporal data from the data point; and 
 determine whether the spatio-temporal data is included in a boundary of a root node of the spatio-temporal data structure; and 
 
 at least one of expansion engine hardware circuitry to expand the spatio-temporal data structure or insertion engine hardware circuitry to insert the spatio-temporal data in the spatio-temporal data structure based on a second determination of whether the spatio-temporal data is included in the boundary. 
 
     
     
       9. The apparatus of  claim 8 , wherein the spatio-temporal data structure is a root hexatree data structure, and further including hexacloud data structure generator hardware circuitry to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive temporal subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative temporal subspace. 
 
     
     
       10. The apparatus of  claim 9 , wherein the hexacloud data structure generator hardware circuitry is to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive temporal subspaces with first temporal data greater than a temporal value associated with the hyperspace center; and 
 associate the respective negative temporal subspaces with second temporal data less than the temporal value associated with the hyperspace center. 
 
     
     
       11. The apparatus of  claim 8 , wherein the spatio-temporal data structure is a root hexatree data structure, and further including hexacloud data structure generator hardware circuitry to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive spatial subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative spatial subspace. 
 
     
     
       12. The apparatus of  claim 11 , wherein the hexacloud data structure generator hardware circuitry is to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive spatial subspaces with first spatial data greater than a spatial value associated with the hyperspace center; and 
 associate the respective negative spatial subspaces with second spatial data less than the spatial value associated with the hyperspace center. 
 
     
     
       13. The apparatus of  claim 8 , wherein the spatio-temporal data structure is a first hexatree data structure, and the expansion engine hardware circuitry is to, in response to a third determination that the spatio-temporal data is not included in the boundary:
 determine an expansion direction for a second hexatree data structure to be associated with the first hexatree data structure; 
 generate at least one of a spatial offset value or a temporal offset value for a new location of the spatio-temporal data in the second hexatree data structure; 
 identify a hyperspace center point of the second hexatree data structure based on a space-time delta; and 
 associate the first hexatree data structure as a child node to the second hexatree data structure. 
 
     
     
       14. The apparatus of  claim 8 , wherein the insertion engine hardware circuitry is to, in response to a receipt of the spatio-temporal data from an agent and in response to a third determination that the spatio-temporal data is included in the boundary:
 determine a storage location for metadata associated with the spatio-temporal data; 
 in response to a fourth determination that the storage location is local to the agent, store the metadata into storage of the agent; and 
 in response to a fifth determination that the storage location is in storage separate from the agent, store the metadata in a database or a networked cloud storage. 
 
     
     
       15. At least one non-transitory computer readable storage medium comprising instructions that, when executed, cause processor circuitry to at least:
 in response to a first determination that a write request associated with a spatio-temporal data structure includes a data point to be added to the spatio-temporal data structure, extract spatio-temporal data from the data point; 
 determine whether the spatio-temporal data is included in a boundary of a root node of the spatio-temporal data structure; and 
 at least one of expand the spatio-temporal data structure or insert the spatio-temporal data in the spatio-temporal data structure based on a second determination of whether the spatio-temporal data is included in the boundary. 
 
     
     
       16. The at least one non-transitory computer readable storage medium of  claim 15 , wherein the spatio-temporal data structure is a root hexatree data structure, and the instructions, when executed, cause the processor circuitry to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive temporal subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative temporal subspace. 
 
     
     
       17. The at least one non-transitory computer readable storage medium of  claim 16 , wherein the instructions, when executed, cause the processor circuitry to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive temporal subspaces with first temporal data greater than a temporal value associated with the hyperspace center; and 
 associate the respective negative temporal subspaces with second temporal data less than the temporal value associated with the hyperspace center. 
 
     
     
       18. The at least one non-transitory computer readable storage medium of  claim 15 , wherein the spatio-temporal data structure is a root hexatree data structure, and the instructions, when executed, cause the processor circuitry to:
 generate the root hexatree data structure to have a plurality of hypernodes; 
 assign a first portion of the plurality of the hypernodes to have a respective positive spatial subspace; and 
 assign a second portion of the plurality of the hypernodes to have a respective negative spatial subspace. 
 
     
     
       19. The at least one non-transitory computer readable storage medium of  claim 18 , wherein the instructions, when executed, cause the processor circuitry to:
 identify a hyperspace center of the root hexatree data structure; 
 associate the respective positive spatial subspaces with first spatial data greater than a spatial value associated with the hyperspace center; and 
 associate the respective negative spatial subspaces with second spatial data less than the spatial value associated with the hyperspace center. 
 
     
     
       20. The at least one non-transitory computer readable storage medium of  claim 15 , wherein the spatio-temporal data structure is a first hexatree data structure, and the instructions, when executed, cause the processor circuitry to, in response to a third determination that the spatio-temporal data is not included in the boundary:
 determine an expansion direction for a second hexatree data structure to be associated with the first hexatree data structure; 
 generate at least one of a spatial offset value or a temporal offset value for a new location of the spatio-temporal data in the second hexatree data structure; 
 identify a hyperspace center point of the second hexatree data structure based on a space-time delta; and 
 associate the first hexatree data structure as a child node to the second hexatree data structure. 
 
     
     
       21. The at least one non-transitory computer readable storage medium of  claim 15 , wherein the instructions, when executed, cause the processor circuitry to:
 receive the spatio-temporal data from an agent; and 
 in response to a third determination that the spatio-temporal data is included in the boundary:
 determine a storage location for metadata associated with the spatio-temporal data; 
 in response to a fourth determination that the storage location is local to the agent, store the metadata into storage of the agent; and 
 in response to a fifth determination that the storage location is in storage separate from the agent, store the metadata in a database or a networked cloud storage.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.