持久对象的Refsort-loops连接算法

The Refsort-loops Join Algorithm of Persistence Objects

对象关系模型中,基于引用导航的对象连接效率不高,鉴于此,文章提出Refsort-loops连接算法:通过缓存关联对象的引用,并依照重新排序后的引用序列查询关联对象。该算法可以避免对位于同一数据块上不同记录的重复读取,并给出了性能分析公式;通过模拟实验证明了基于该算法的对象连接运算可以减少磁盘的IO次数,节省磁盘的访问时间。

Objects connection reduce in efficency and performance based on refrence navigation.So this paper provides Refsort-loops algorithm：which refers cache-relation object and query relation object relies on reference sequences after sorting afresh.It can avoid reading the recods in the same date block repeatedly.The formula has been given and simulative experiments is proved that it can cut down the time for accessing to disk at expense.