一个基于引用的高效连接算法

A Reference Based on High Performance Joining Algorithm

针对对象关系数据模型和查询语言的新特点 ,提出了一个基于引用的高效连接算法Sort Loop。引用既是对象关系数据模型中一种重要的建模设施 ,同时它也有利于连接算法的设计和高效实现 ,如Hash Loops就是基于指针、面向集合属性的连接算法。Sort Loop克服了Hash Loops算法在数据访问方式和内存使用上存在的不足 ,性能分析表明 ,其性能优于Hash Loops。

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.