An Implementation Scheme of Relational Tables Based on History Offset Method and Its Evaluation

基于历史偏移法的关系表实现方案及其评估

• 批准号: 17500065
• 负责人: TSUJI Tatsuo
• 金额: $ 1.92万
• 依托单位: University of Fukui
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2005
• 资助国家: 日本
• 起止时间: 2005 至 2006
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-17500065/
• 关键词: Multidimensional Array; Extendible Array; Relational Table; Record Encoding; MOLAP

In this year, based on the relational database kernel implemented by history offset method called HORT developed in the last year, schemes of higher level subsystems of relational database system have been designed, implemented and evaluated. These schemes include: 1. Processing scheme of range key queries, 2. Parallel processing scheme, 3. design and implementation of SQL processors, 4. Design of complex objects.1. In our proposed scheme, since a record can be mapped to an element of a multidimensional extendible array and the element position is mapped to linear address space, dimension dependency problem would be caused in a range key retrieval. This problem has been alleviated by designing a scheme considering the characteristics of HORT data structure. Using the implemented prototype system, the performance of range key queries has been measured and evaluated.2. An extendible array, which is the underlying data structure in HORT, is suited to parallel processing. Focusing on this good property of HORT, we have designed and implemented a load balancing scheme and synchronizing scheme of collecting retrieval results. Using the implemented prototype system, the performance of parallel retrieval scheme has been measured.3. We are now under construction of SQL processor incorporating the range key query processing scheme in 1. Especially an efficient scheme of processing table join operation is being designed and implemented.4. A complex object has an object ID of another object as its reference attribute. We have proposed an efficient handling scheme of complex objects set by introducing the notion of record ID into the original HORT data structure.

本年度在去年开发的历史偏移法实现的关系数据库内核霍特的基础上，设计、实现和评价了关系数据库系统的高层子系统方案。这些计划包括：1.范围键查询的处理方案; 2.并行处理方案，3. SQL处理器的设计与实现; 4.复杂对象的设计。1.在我们提出的方案中，由于记录可以被映射到一个多维可扩展数组的元素和元素的位置被映射到线性地址空间，维度依赖性问题将导致在范围键检索。针对霍特数据结构的特点，设计了一种解决方案。利用实现的原型系统，对范围键查询的性能进行了测试和评价.可扩展数组是霍特的底层数据结构，适合于并行处理。针对霍特的这一优良特性，我们设计并实现了一个负载均衡方案和检索结果收集同步方案。利用实现的原型系统，对并行检索方案的性能进行了测试.我们现在正在建设的SQL处理器纳入范围关键字查询处理方案在1。特别是设计并实现了一种高效的表连接操作处理方案.复杂对象具有另一个对象的对象ID作为其引用属性。我们提出了一个有效的处理方案，复杂的对象集，通过引入记录ID的概念到原来的霍特数据结构。

项目成果

経歴・オフセット法により実装された関係テーブルの分割管理

使用history/offset方法实现关系表的拆分管理

• 发表时间: 2005
• 期刊: 平成17年度電気関係学会北陸支部連合大会講演論文集 E-70
• 作者: 伊藤雄一;エフードシャーリン;北村喜文;岸野文郎;ベンジャミンワトソン;スティーブステファン;リリリウ;嶋田鉄兵;相羽洋平
• 通讯作者: 相羽洋平

挿入拡張・中抜き縮小可能な多次元配列

多维数组，可以通过插入扩大，通过空洞缩小。

• 发表时间: 2006
• 期刊: 日本データベース学会Letters 5-1
• 作者: H.Agata;A.Yamashita;T.Kaneko;熊切正和
• 通讯作者: 熊切正和

A parallel implementation scheme of relational tables based on multidimensional extendible a

一种基于多维可扩展关系表的并行实现方案

• 发表时间: 2006
• 期刊: International Journal Journal of Data Warehousing and Mining 2-4
• 作者: Naoshige;Kinjo;Michihiro;Kobayakawa;Mamoru;Hoshi;Tadashi;Ohmori;Michihiro Kobayakawa and Mamoru Hoshi;相羽洋平;Yohei Aiba;Masakazu Kumakiri;Tatsuo Tsuji;Masakazu Kumakiri;K.M.A.Hasan;K.M.A.Hasan
• 通讯作者: K.M.A.Hasan

チャンク化拡張可能配列による関係テーブルの実装と評価

使用分块可扩展数组实现和评估关系表

• 发表时间: 2007
• 期刊: 電子情報通信学会データ工学ワークショップ論文集 A2-5
• 作者: Naoshige;Kinjo;Michihiro;Kobayakawa;Mamoru;Hoshi;Tadashi;Ohmori;Michihiro Kobayakawa and Mamoru Hoshi;相羽洋平
• 通讯作者: 相羽洋平

A parallel implementation scheme of relational tables based on multidimensional extendible arrays

一种基于多维可扩展数组的关系表并行实现方案

• 发表时间: 2006
• 期刊: International Journal of Data Warehousing and Mining
• 影响因子: 1.2
• 作者: Naoshige;Kinjo;Michihiro;Kobayakawa;Mamoru;Hoshi;Tadashi;Ohmori;Michihiro Kobayakawa and Mamoru Hoshi;相羽洋平;Yohei Aiba;Masakazu Kumakiri;Tatsuo Tsuji;Masakazu Kumakiri;K.M.A.Hasan
• 通讯作者: K.M.A.Hasan