Large-scale concurrent scheduling-supported method for placing three-dimensional spatial data

Abstract

The invention relates to the technical field of geographic spatial information systems and provides a large-scale concurrent scheduling-supported method for placing three-dimensional spatial data. The method comprises the following steps of: detecting a hardware environment of storage equipment of a server and acquiring the disk information of the storage equipment, and updating a description file of the disk information; determining respective multi-disk distributed placement schemes of the three-dimensional spatial data of all types based on data content analysis of the three-dimensional spatial data and the description of the disk information of the storage equipment; performing multi-disk distributed placement on the three-dimensional spatial data of all types according to the multi-disk distributed placement schemes; and updating the description file of the disk information of the storage equipment in real time according to respective multi-disk distributed placement conditions of the three-dimensional spatial data of all types. According to the large-scale concurrent scheduling-supported method for placing the three-dimensional spatial data, through performing the multi-disk distributed placement on the three-dimensional spatial data of different types, and therefore, application requirements of large-scale user concurrent data scheduling and three-dimensional real-time visualization are effectively supported.

Description

technical field [0001] The invention relates to the technical field of geographic space information systems, in particular to a large-scale concurrent three-dimensional space data placement method. Background technique [0002] Despite the rapid development of computer hardware technology, the performance of database management systems has also been greatly improved, however, the processing power required to quickly process complex spatial data operations and the performance provided by existing spatial databases still cannot fully match, which has led to three-dimensional spatial The performance of the database is mostly limited by the ability to respond to spatial operations and the I / O throughput for accessing a large number of three-dimensional spatial data. Since 3D spatial database applications are always accompanied by intensive I / O operations and CPU (Central Processing Unit, central processing unit) operations, usually the CPU accesses the memory at a very fast spee...

AI Technical Summary

Problems solved by technology

[0005] The present invention provides a large-scale concurrent three-dimensional space data placement method, aiming to solve the problem that the existing technology is difficult to obtain the best distribution effect for the multi-disk distribution of large-scale three-dimensional space data, and cannot break through the large-scale multi-user concurrency. The technical problem of the I / O bottleneck of the 3D spatial database reading

Images