Performance analysis of data organization of the real-time memory database based on red-black tree

2010 International Conference on Computing, Control and Industrial Engineering, CCIE 2010

Volumn 1, Issue , 2010, Pages 428-430

  Liang, Qiaoyu ^a   Li, Jianwei ^a   Xu, Yubin ^a  

^a TAIYUAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Accessing; Querying; Real time memory database; Red Black tree

Indexed keywords

DATA ORGANIZATION; MEMORY DATABASE; PERFORMANCE ANALYSIS; REAL-TIME DATABASE; RED BLACK TREE;

DATABASE SYSTEMS; INDUSTRIAL ENGINEERING;

TREES (MATHEMATICS);

EID: 77955196392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCIE.2010.113     Document Type: Conference Paper

References (8)

1. Zhao-Yuan Li,Xiao-Pei Luo. The database technology progresses newly[M]. Qinghua University publishing house, 2007.
2. Rui-Ying Cai. Modern computer commonly used construction of data and algorithm[M]. Nanjing: Nanjing University publishing house, 1994.
3. COLLINSW J. Data Structures and the Standard Template Library[M]. Boston: McGraw-Hill, 2003.
4. H.Garcia-Mollina, K.Salem.Main memory database systems: An overview.IEEE rans.on Knowledge and Data Engineering,1992,4(6):509-516.
5. QingGao,FanJiang.ApplicationofRBtreealgorithm[J].Software Guid,2008(9).
6. Dong-Jun Luo.A List Structure Capable of Fast Searching Based on the Red-Black tree.Journal of Yunnan Nationlities University.2008(3).
7. Qiang-Zhang Chen.An efficient Binary Search Tree Read-Black tree.Journal of East China Normal University,2000(3).
8. Azer Bestavros and Sue Nagy,"Value-cognizant Admission Control for RTDB Systems,"IEEE 16th Real-Time Systems Symposium,December 1996.