Marine big data are characterized by a large amount and complex structures, which bring great challenges to data management and retrieval. Based on the GeoSOT Grid Code and the composite index structure of the MongoDB database, this paper proposes a spatio-temporal grid index model (STGI) for efficient optimized query of marine big data. A spatio-temporal secondary index is created on the spatial code and time code columns to build a composite index in the MongoDB database used for the storage of massive marine data. Multiple comparative experiments demonstrate that the retrieval efficiency adopting the STGI approach is increased by more than two to three times compared with other index models. Through theoretical analysis and experimental verification, the conclusion could be achieved that the STGI model is quite suitable for retrieving large-scale spatial data with low time frequency, such as marine big data.

As the amount of collected spatial information (2D/3D) increases, the real-time processing of these massive data is among the urgent issues that need to be dealt with. Discretizing the physical earth into a digital gridded earth and assigning an integral computable code to each grid has become an effective way to accelerate real-time processing. Researchers have proposed optimization algorithms for spatial calculations in specific scenarios. However, a complete set of algorithms for real-time processing using grid coding is still lacking. To address this issue, a carefully designed, integral grid-coding algebraic operation framework for GeoSOT-3D (a multilayer latitude and longitude grid model) is proposed. By converting traditional floating-point calculations based on latitude and longitude into binary operations, the complexity of the algorithm is greatly reduced. We then present the detailed algorithms that were designed, including basic operations, vector operations, code conversion operations, spatial operations, metric operations, topological relation operations, and set operations. To verify the feasibility and efficiency of the above algorithms, we developed an experimental platform using C++ language (including major algorithms, and more algorithms may be expanded in the future). Then, we generated random data and conducted experiments. The experimental results show that the computing framework is feasible and can significantly improve the efficiency of spatial processing. The algebraic operation framework is expected to support large geospatial data retrieval and analysis, and experience a revival, on top of parallel and distributed computing, in an era of large geospatial data.

With the rapid development of large-scale satellite constellations and the increasing demand for rapid communication and emergency rescue using global satellite-based Internet, there have been new requirements for efficient algorithms for inter-communication between satellites. As the constellations of low-orbit satellites become larger, the complexities of real-time inter-satellite calculation and path planning are becoming more complicated and are increasing geometrically. To address the bottlenecks in large-scale node space computing, we introduced a global space grid. Based on this grid, an efficient calculation method of spatial inter-connection between satellite constellations is proposed, according to the concept of “storage for computing” and the high computational efficiency of the spatial grid model. This strategy includes the following parts: (1) the introduction of the GeoSOT-3D global grid model into aerospace and the construction of the aerospace grid indexing BigTable; (2) a set of algorithms for satellite visibility analysis according to the visible grid look-up table and the secondary grid index; and (3) planning inter-satellite routing by querying the grid’s inherent visibility. The idea at the basis of this method is to employ the “space for time” concept to convert the high-dimensional floating operations into one-dimensional matching operations by querying the inherent “visible” attribute of the grid. In our study, we simulated thousands of satellites, discretized their trajectories into grids, and pre-calculated the visibility between grid cells to plan the routing path for the ground data transmission. The theoretical analysis and experimental verification show that the algorithm is feasible and efficient, and it can significantly improve the computational efficiency of inter-satellite connection. We hope that the method can be used in emergency communications, disaster warning, and maritime rescue, and can contribute to the next generation of satellite internet and “satellite-ground” integrated networks.

Based on the analysis of the problems in the generation algorithm of discrete grid systems domestically and abroad, a new universal algorithm for the unit duplication of a polyhedral discrete grid is proposed, and its core is “simple unit replication + effective region restriction”. First, the grid coordinate system and the corresponding spatial rectangular coordinate system are established to determine the rectangular coordinates of any grid cell node. Then, the type of the subdivision grid system to be calculated is determined to identify the three key factors affecting the grid types, which are the position of the starting point, the length of the starting edge, and the direction of the starting edge. On this basis, the effective boundary of a multiscale grid can be determined and the grid coordinates of a multiscale grid can be obtained. A one-to-one correspondence between the multiscale grids and subdivision types can be established. Through the appropriate rotation, translation and scaling of the multiscale grid, the node coordinates of a single triangular grid system are calculated, and the relationships between the nodes of different levels are established. Finally, this paper takes a hexagonal grid as an example to carry out the experiment verifications by converting a single triangular grid system (plane) directly to a single triangular grid with a positive icosahedral surface to generate a positive icosahedral surface grid. The experimental results show that the algorithm has good universality and can generate the multiscale grid of an arbitrary grid configuration by adjusting the corresponding starting transformation parameters.