arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.12102cs.DB
收藏

超最坏情况连接处理的盒覆盖和域排序

Box Covers and Domain Orderings for Beyond Worst-Case Join Processing

Kaleb Alway, Eric Blais, Semih Salihoglu

摘要:

最近超越最坏情况的最优连接算法扫雷和它的推广俄罗斯方块带来了索引和连接处理的理论,通过开发一个几何框架连接。这些算法将索引$\mathcal{B}$(称为箱盖)作为输入,该索引存储可以从输入关系上的传统索引(例如B+树或尝试)推断出的输出间隙。这些算法的性能高度依赖于$\mathcal{B}$的证书,该证书是$\mathcal{B}$中的间隙的最小子集,其并集覆盖查询$Q$的输出空间中的所有间隙。我们研究如何生成包含小尺寸证书的盒子封面,以保证这些算法的高效运行。首先,给定一个查询$Q$的一组关系的大小$N$和一组固定的域排序的属性,我们给出了一个$\tilde{O}(N)$的时间算法称为GAMB生成一个盒盖为$Q$,保证包含最小大小的证书在任何盒盖为$Q$。其次,我们发现,找到一个域排序,以最大限度地减少盒子盖的大小和证书是NP-困难的,通过减少从2个连续的块最小化问题的布尔矩阵。我们的第三个贡献是一个$\tilde{O}(N)$-时间近似算法称为ADORA计算域排序,根据它可以计算一个大小为$\tilde{O}(K^r)$的盒子覆盖,其中$K$是$Q$在任何域排序下的最小盒子覆盖,$r$是任何关系的最大值。这保证证书的大小为$\tilde{O}(K^r)$。我们结合ADORA和GAMB与俄罗斯方块,形成一个新的算法,我们称之为TetrisReordered,它提供了几个新的超越最坏情况的界限。在查询的无限族上,TetrisReordered的运行时比以前的工作中所述的界限更好。

英文摘要:

Recent beyond worst-case optimal join algorithms Minesweeper and its generalization Tetris have brought the theory of indexing and join processing together by developing a geometric framework for joins. These algorithms take as input an index $\mathcal{B}$, referred to as a box cover, that stores output gaps that can be inferred from traditional indexes, such as B+ trees or tries, on the input relations. The performances of these algorithms highly depend on the certificate of $\mathcal{B}$, which is the smallest subset of gaps in $\mathcal{B}$ whose union covers all of the gaps in the output space of a query $Q$. We study how to generate box covers that contain small size certificates to guarantee efficient runtimes for these algorithms. First, given a query $Q$ over a set of relations of size $N$ and a fixed set of domain orderings for the attributes, we give a $\tilde{O}(N)$-time algorithm called GAMB which generates a box cover for $Q$ that is guaranteed to contain the smallest size certificate across any box cover for $Q$. Second, we show that finding a domain ordering to minimize the box cover size and certificate is NP-hard through a reduction from the 2 consecutive block minimization problem on boolean matrices. Our third contribution is a $\tilde{O}(N)$-time approximation algorithm called ADORA to compute domain orderings, under which one can compute a box cover of size $\tilde{O}(K^r)$, where $K$ is the minimum box cover for $Q$ under any domain ordering and $r$ is the maximum arity of any relation. This guarantees certificates of size $\tilde{O}(K^r)$. We combine ADORA and GAMB with Tetris to form a new algorithm we call TetrisReordered, which provides several new beyond worst-case bounds. On infinite families of queries, TetrisReordered's runtimes are unboundedly better than the bounds stated in prior work.

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

↑