论文标题
分类合并连接操作的非恢复方法
Non-recursive Approach for Sort-Merge Join Operation
论文作者
论文摘要
多年来，已经开发了几种算法来执行加入操作，该操作经常执行并影响数据库系统的效率。其中一些努力证明，加入绩效主要取决于硬件体系结构之外的关系执行序列。在本文中，我们提出了一种方法，该方法通过使用非恢复反向的波兰语符号树来处理多对多的多连接操作，以进行分类 - 合并。确切地说，本文更多地阐明了两种类型的排序连接序列的主内存连接操作：顺序连接序列（线性树）和常规联接序列（宽浓密树，也称为复合内部），并测试其性能和功能。我们还将提供显示实现步骤的建议系统的算法。
Several algorithms have been developed over the years to perform join operation which is executed frequently and affects the efficiency of the database system. Some of these efforts prove that join performance mainly depends on the sequences of execution of relations in addition to the hardware architecture. In this paper, we present a method that processes a many-to-many multi join operation by using a non-recursive reverse polish notation tree for sort-merge join. Precisely, this paper sheds more light on main memory join operation of two types of sort-merge join sequences: sequential join sequences (linear tree) and general join sequences (wide bushy tree, also known as composite inner) and also tests their performance and functionality. We will also provide the algorithm of the proposed system that shows the implementation steps.
