Font Size: a A A

Real-time Memory Database Data Organization Structure Optimization Strategy

Posted on:2011-05-26Degree:MasterType:Thesis
Country:ChinaCandidate:Q Y LiangFull Text:PDF
GTID:2208360308471816Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Along with the improving of the automation and integration, Real-Time Memory Database which has become the core of enterprise software systems, and also the foundation of real-time monitoring and managing the production information during the production process, is the premise of analyzing the data and optimizing the conformity. Real-Time Memory Database emphasizes real-time and accuracy on processing data. Enhancing the utilization of CPU and memory are the total designing goal of the Real-Time Memory Database, and the data organization structure is the foundation to realize this goal.This paper focuses on the organizational structure of Real-Time Memory Database. According to the overall system performance requirements and its characteristic of functions, the paper proposes the red-black tree to the data organization structure of the Real-Time Memory Database. Firstly, the concept and related technologies of Real-Time Database Memory is discussed. Secondly, this paper researches the advantages and disadvantages of the data structure on today's Real-Time Memory Database, and analyzes the T tree, B tree and AVL tree. Then Real-Time Memory Database based on these data structure is compared and studied. The third, the Real-Time Memory Database based on the red-black tree and the querying optimization program are mainly researched. The fourth, according to the researches above, the paper establishes the model of real-time memory structure based on red-black tree and uses C++ language to realize. Finally, the test is completed to compare the model of the Real-Time Memory Database based on red-black tree with the model of the Real-Time Memory Database based on AVL- tree structure. The result of the test shows that the red-black tree's querying and storage performance is following the AVL tree, but the accessing performance outshines the AVL tree even more. Therefore, considering the accessing and storage performance, using the red-black tree to the data organization structure of the Real-Time Memory Database is a viable optimization solution.
Keywords/Search Tags:Real-Time Database, Memory Database, Red-Black tree, Querying optimization
PDF Full Text Request
Related items