| 内存数据库系统SwiftMMDB索引机制的设计与实现 |
| |
| 引用本文： | 赵艳梅,郑鑫福,徐立臻.内存数据库系统SwiftMMDB索引机制的设计与实现[J].计算机应用,2011,31(9):2395-2398. |
| |
| 作者姓名： | 赵艳梅 郑鑫福 徐立臻 |
| |
| 作者单位： | 1. 国家自然科学基金委员会 信息中心，北京 1000852. 东南大学 计算机科学与工程学院，南京 210096 |
| |
| 基金项目： | 国家自然科学基金资助项目(M1021003) |
| |
| 摘 要： | T树结合了平衡二叉树(AVL树)和B树的优点，可以有效地组织索引数据，从而为内存数据库提供优良的存储效率和查询性能。结合自主开发的一个内存数据库系统SwiftMMDB介绍T树索引的设计与实现，并通过节点分裂、填充等方法改进了经典T树的插入和删除操作，减少了T树中平衡旋转的次数，从而进一步提高内存数据库检索的效率和性能。
|
| 关 键 词： | 内存数据库 索引 T树 平衡二叉树 B 树 |
| 收稿时间： | 2011-03-10 |
| 修稿时间： | 2011-04-26 |
Design and implementation of index in main memory database system named SwiftMMDB |
| |
| ZHAO Yan-mei,ZHENG Xin-fu,XU Li-zhen.Design and implementation of index in main memory database system named SwiftMMDB[J].journal of Computer Applications,2011,31(9):2395-2398. |
| |
| Authors: | ZHAO Yan-mei ZHENG Xin-fu XU Li-zhen |
| |
| Affiliation: | 1. Information Center, National Natural Science Foundation of China, Beijing 100085, China2. School of Computer Science and Engineering, Southeast University, Nanjing Jiangsu 210096, China |
| |
| Abstract: | T tree, combining the advantages of AVL tree and B tree, can organize index data efficiently, thus providing good storage efficiency and search performance for main memory database. The design and implementation of T tree index was presented in the main memory database system named SwiftMMDB which was developed by the authors' research group recently. The insert and delete operations of traditional T tree were improved through node splitting and node populating method. The rotation number for balance in T tree was reduced. As a result, the retrieve efficiency and performance of main memory database system are improved. |
| |
| Keywords: | main memory database index T tree AVL tree B tree |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
