| 引用本文: | 阳国贵,吴泉源.一个基于引用的高效连接算法.[J].国防科技大学学报,2000,22(5):68-72.[点击复制] |
| YANG Guogui,WU Quanyuan.A Reference Based on High Performance Joining Algorithm[J].Journal of National University of Defense Technology,2000,22(5):68-72[点击复制] |
|
| |
|
|
| 本文已被：浏览 6373次 下载 5518次 |
| 一个基于引用的高效连接算法 |
| 阳国贵, 吴泉源 |
|
(国防科技大学 计算机学院, 湖南长沙 410073)
|
| 摘要: |
| 针对对象关系数据模型和查询语言的新特点, 提出了一个基于引用的高效连接算法Sort-Loop。引用既是对象关系数据模型中一种重要的建模设施, 同时它也有利于连接算法的设计和高效实现, 如Hash-Loops 就是基于指针、面向集合属性的连接算法。Sort-Loop 克服了Hash-Loops 算法在数据访问方式和内存使用上存在的不足, 性能分析表明, 其性能优于Hash-Loops。 |
| 关键词: 连接算法 对象关系数据库 算法分析 |
| DOI： |
| 投稿日期：2000-02-01 |
| 基金项目:国家部委基金项目资助(98J15.2.5.KG0133) |
|
| A Reference Based on High Performance Joining Algorithm |
| YANG Guogui, WU Quanyuan |
|
(College of Computer, National Univ. of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| Based on the features of ORDM(Object-Relational Data Model) and the query language, a new reference based on join algorithm Sort-Loop is represented. Reference is not only one of the important modeling mechanism, but also beneficial to the design and implementation of joining algorithms, such as Hash-Loops. By overcoming the shortcomings of the Hash-Loops in the data access manner and the use of the main memory, Sort-Loop is of high performance. This is validated by the analysis in the paper. |
| Keywords: join algorithm ORDB algorithm analysis |
|
|
|
|
|
