Performance Analysis of Data Organization of the Real-Time Memory Database Based on Red-Black Tree

A scheme of the real-time memory database data organization based on Red-Black tree is presented and the performance is compared with other structure used in the real-time database referring to the practical application in the paper. According to the theory analysis and experiment, it is shown that the method has great superiority on inserting and deleting the magnanimous data.