基于BSP的并行对象-关系型数据库的分析和设计  

Analysis & Design of Parallel Object Relational Database Based on BSP Model

作　　者：陈昌生[1] 孙永强[1] 

机构地区：[1]上海交通大学计算机科学与工程系,上海200030

出　　处：《上海交通大学学报》1999年第9期1167-1169,1185,共4页Journal of Shanghai Jiaotong University

摘　　要：以含幺半群演算（Ｍｏｎｏｉｄ ｃａｌｃｕｌｕｓ）为基础，构造了统一的数据模型．该模型形式简单，表达能力强，容易扩充，几乎能表示所有ＳＱＬ３ 和对象查询语言（ＯＱＬ）查询．以块同步并行（ＢＳＰ）模型为通用并行环境，设计、分析了多种一维数据分布方法，采用较适合ＢＳＰ的（ａ，ｂ）树作为存储结构，并对查询优化、事务处理及主要数据库操作（如Ｊｏｉｎ 算法、外部排序算法）等进行了分析．结果表明，结合ＭｏｎｏｉｄCurrentparalleldatabasesystem sare m ainly aboutthe traditionalrelationaldatabase, and m ost ofthem are based on special purpose parallelfram eworks and there has been little generalparallelORDB (object relationaldatabase) system . Based on m onoid calculus, this paper generated a generalpurpose data m odelw hich issim ple buthas pow erfulexpressive abilities and good extensibilities. This data m odel can alm ostexpressallofSQL3 and OQLqueries. Choosing BSP(bulk synchronous parallel) m odelas an idealgeneralparallelenvironm ent, the paperdesigned and analyzed severalm ethodsofone dim ension data placem ent, applied (a, b) tree, suitable for BSP, to data storage structures, discussed the query optim ization, transaction processing and prim ary database operations such as Join algorithm s, outer sort algorithm s and so on. Com bining m onoid calculus with BSP, itis practicalto generate a generalpurpose parallelORDBsystem .

关 键 词：并行数据库 关系型数据库 并行计算 BSP模型 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]