Year: 2024
Type: conference-paper
Abstract: In aerospace systems, B+ trees are typically used for data management and indexing. However, traditional B+ trees have issues with data reliability and slower indexing speeds when handling massive data volumes. To address these issues, an improved B+ tree structure is proposed. This improvement involves a custom memory pool to manage the creation and deletion of tree nodes and employs a dynamic optimization algorithm to reduce the height of the B+ tree. Additionally, an automatic snapshot and logging system is introduced to ensure the recoverability of the B+ tree in case of system failures, enhancing its performance and reliability in complex environments. Comparative experiments indicate that the improved B+ tree achieves a 14.02% increase in efficiency for node insertion operations, a 27.39% speed improvement in searching for specific keys, and reduced memory consumption due to the dynamic optimization algorithm, demonstrating significant advantages in memory-constrained aerospace systems.
Authors: Yan Yu, Junmiao Tang, Hesong Zhang, Hesheng Zhang
Institution: Shanghai University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4407706229