期刊文献+

内存数据库系统SwiftMMDB存储管理的设计与实现

Design and Implementation of Storage Management in Main Memory Database System SwiftMMDB
下载PDF
导出
摘要 该文在深入研究内存数据库系统存储管理技术的基础上,给出了自主开发的内存数据库系统SwiftMMDB存储管理模块的设计与实现方案,针对不同种类的应用背景,设计了两种数据库系统的运行结构以加快本地数据访问;分析并比较了三种内存空间分配方式,使SwiftMMDB能够根据不同应用场合的需求特点选用不同的底层内存分配方式;将哈希索引与T树索引相结合对查询进行优化,提高内存数据库的查询效率。 Main Memory Database(MMDB) greatly improves the database overall performance by taking advantage of memory's characteristics to avoid the traditional hard disk database I/O operations.In this paper,the design and implementation of storage management in MMDB system SwiftMMDB are introduced in detail.Two kinds of process structures are proposed to fit the demands of different scenarios respectively.Three memory allocation methods are analyzed and compared,which makes SwiftMMDB select different memory allocation method adaptively according to variable application backgrounds.The hash index is combined with T tree index to enhance query performance of SwiftMMDB.
出处 《计算机与数字工程》 2011年第11期47-50,共4页 Computer & Digital Engineering
基金 国家自然科学基金项目(编号:M1021003)资助
关键词 内存数据库 存储管理 多进程运行结构 main memory database storage management multi-process structure
  • 相关文献

参考文献11

  • 1Ammann A. C, et al. Design of a memory resident DBMS[M]. Int. Proc IEEE COMPCON: San Francis- co, 1985.
  • 2Garcia-Molina H. , Salem K. Main memory database systems: an overview[C]//Knowledge and Data Engi- neering, 1992,4(6) : 509.
  • 3[美]JohnShapleyGray.UNIX进程间通信[M].第二版.张宁,等译.北京:电子工业出版社,2001.
  • 4Paul R. Wilson, Mark S. Johnstone, Michael Neely. Dynamic Storage Allocation A Survey and Critical Re- view[M]. Lecture Notes in Computer Science, 1995, 986.
  • 5刘云生,何君辉.一种主动实时数据库的系统内存管理方法[J].计算机应用,2004,24(4):23-25. 被引量:8
  • 6T. J. Lehman, M. J. Carey. A Study of Index Struc- tures for Main Memory Database Management Systems [C]//Proceedings 12th Int. Conf. On Very Large Da- tabase Kyoto, 1986,8 : 294-303.
  • 7Hongjun Lu, Yuet Yeung Ng, Zengping Tian. T-Tree or B-Tree: Main Memory Database Index Structure Re- visited[C]//Database Conference, 2000,22(2).
  • 8林鹏,李航,徐学洲.关键业务中内存数据库的T树索引优化[J].计算机工程,2004,30(17):75-76. 被引量:7
  • 9王祥雒,李毅.Linux中基于mmap()的共享存储实现研究[J].计算机应用,2006,26(S2):307-309. 被引量:6
  • 10钟世国,卢正新.内存数据库一种紧凑的存储结构[J].计算机与数字工程,2009,37(12):50-53. 被引量:2

二级参考文献18

  • 1刘云生.实时数据库系统[J].计算机科学,1994,21(3):42-46. 被引量:53
  • 2刘云生,胡国玲,彭嘉雄.ARTs-I:一个主动实时内存数据库系统[J].华中理工大学学报,1996,24(3):31-34. 被引量:24
  • 3吴绍春,胡国玲,李国辉,舒良才.一种内存数据库定义及相关技术探讨[J].江汉石油学院学报,1996,18(4):91-94. 被引量:7
  • 4Garcia-Molina, H. , Salem, K.. Main memory database systems: an overview, Knowledge and Data Engineering[J]. IEEE Transactions on Volume 4, Issue 6, 1992, (12) : 509-516.
  • 5T J Lehman, M J Carey. A. A study of index structures for main memory database management systems [C]. Proc of the Intl Conf on Very Large Database, 1986: 294-303.
  • 6Hongjun Lu, Yuet Yeung Ng, Zengping Tian. T tree or B-tree: main memory database index structure revisited, Database Conference, 2000. ADC 2000[C]. Proceedings. 11th Australasian 31 Jan. 3 Feb,2000,2:65-73.
  • 7Kong-Rim Choi, Kyung-Chang Kim. T-tree: A Main Memory Database Index Structure for Real Time Applieations[J]. Dept. Of Computer Science.
  • 8Ekman, Stenstrom. Cost-Effective Main Memory Organization for Future Servers[C]. Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International04-08,2005,4: 45a- 45a.
  • 9Le Gruenwald, Margaret H. Eich. Choosing the best storage technique for a main memory database system [J]. Information Technology, 1990.
  • 10Pucheral, P. , Thevenin, J. M. , Valduriez, P. Efficient Main Memory Data Management Using the DBGraph Storage Model, Very Large Data Bases[C]. 16th International Conference on Very Large Data Bases, 1990,683-95.

共引文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部