A Dynamic Hashing Method for Storage Optimization of Spacecraft Verification Database

Abstract

In order to facilitate the repetition, deduction and playback of the problems in the test process, the corresponding requirements for the retention of test data are put forward in the current test process of spacecraft data management software. In order to deal with the operation based on data itself and the higher level of extraction and analysis based on data, the use of database to store data has become the highest performance and the most convenient way. Due to the large amount of test data, using a single table storage method can cause the time of data query to increase rapidly until it is unacceptable. However, several commonly used table partitioning methods also have their own defects which make it difficult to apply in this scenario. In this paper, a dynamic hashing method (DSH algorithm) is proposed to partition the data according to the characteristics of generating and using the test data of spacecraft data management. The data is hashed through partitioning process feedback to ensure the bias balance of queue hashing. The dynamic partitioning method ensures that the partition fragmentation is controllable and the number of partitions is reduced. It improves the speed of data storage and query, and improves the efficiency of storage space. So that in the same hardware platform, running a larger and more complex tube software testing work provides a stable and reliable solution.