Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liang Qiaoyu ; Inst. of Syst. Emulation & Comput. Applic., Taiyuan Sci. & Technol. Univ., Taiyuan, China ; Li Jianwei ; Xu Yubin

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.

Published in:

Computing, Control and Industrial Engineering (CCIE), 2010 International Conference on  (Volume:1 )

Date of Conference:

5-6 June 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.