Organizing, Transmitting, and Accessing Vector Data in <scp>DGGS</scp> Based on Progressive Tile Structure

ABSTRACT In order to solve the efficiency problem of massive multiresolution vector data organization in DGGS field, we propose a vector data organization method based on progressive tile structure in DGGS. The method is a combination of DGGS with tile structure, which are traditionally used in the field of GIS. That structure can support tile scheduling and express vector objects asymptotically in the inner pairs of tiles, which reduces the amount of data transfer and improves the access and construction efficiency of vector objects while guaranteeing the efficiency of data scheduling. To validate the above design, we first resampled the global 1:100,000 vector data containing multiple topological types to multiresolution vector data with a data resolution of 1:559,000–1:35,000, the data volume is 22,312 MB after converting to tile structure. Then we carried out three experiments: data volume, data construction, and data access. The results of the experiments show that compared with the organization method based on the traditional tile‐pyramid structure, the method is able to achieve higher construction efficiency and access efficiency, as well as the smaller data storage volume. Therefore, we believe that this method provides an efficient method for the organization of massive multiresolution vector data based on DGGS and also provides an idea for the organization of massive multiresolution data in the field of GIS.