arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.09671cs.DB
收藏

非循环联接中的安全子联接

Safe Subjoins in Acyclic Joins

Foto N. Afrati

摘要:

计算连接的成本很高,通常是由于中间关系很大。对于非循环连接,保证单调连接表达式产生的中间关系不大于连接输出的大小,当它是在完全简化的数据库上计算时。非循环联接的任何子表达式都不能提供这种保证,因为这很容易证明。在本文中,我们考虑连接与投影太,我们问的问题,我们是否可以特征连接子表达式,产生,在每个完全减少的数据库,输出没有悬挂元组(翻译,在没有投影的连接的情况下,输出的大小不大于连接的输出的大小)。我们称这样的子表达式为安全子联接。令人惊讶的是,我们证明了有一个简单的特征如下:一个子连接是安全的,当且仅当有一个连接的解析树(a.k.a.连接树),使得子连接中的关系形成它的子树。如果存在这样的解析树,我们提供一个算法来找到这样的解析树。

英文摘要:

It is expensive to compute joins, often due to large intermediate relations. For acyclic joins, monotone join expressions are guaranteed to produce intermediate relations not larger than the size of the output of the join when it is computed on a fully reduced database. Any subexpression of an acyclic join does not offer this guarantee, as it is easy to prove. In this paper, we consider joins with projections too and we ask the question whether we can characterize join subexpressions that produce, on every fully reduced database, an output without dangling tuples (which translates, in the case of joins without projections, to an output of size not larger than the size of the output of the join). We call such a subexpression a safe subjoin. Surprisingly, we prove that there is a simple characterization which is the following: A subjoin is safe if and only if there is a parse tree of the join (a.k.a. join tree) such that the relations in the subjoin form a subtree of it. We provide an algorithm that finds such a parse tree, if there is one.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑