重访集合包容联接
Set Containment Join Revisited
摘要:
给定集合对象$R$和$S$的两个集合,$R \bowtie_{\subseteq} S$集合包含联接返回所有对象对$(r, s) \in R \times S$,使得$r \subseteq s$。连接除了是所有现代数据管理系统中的一个基本操作符外,还可以用于评估基于关系划分的复杂SQL查询,并作为数据采掘算法的一个模块。用于集合包含联接(PRETTI)的最先进算法在右侧集合$S$上构建倒排索引,并在左侧集合$R$上构建前缀树,该前缀树将具有公共前缀的集合对象分组,从而避免冗余处理。在本文中,我们提出了一个框架,提高PRETTI在两个方向。首先,我们提出了一种基于成本模型的自适应方法来限制前缀树的构建,这样,我们可以大大减少连接的空间和时间成本。其次,我们根据每个集合中的第一个包含的项来划分对象,假设集合中的对象是内部排序的。我们表明,我们可以处理的分区和评估的连接,同时逐步建立前缀树和倒排索引。这使我们不仅可以显著降低连接成本,还可以降低连接过程中的最大内存需求。使用真实和合成数据集的实验评估表明,我们的框架优于PRETTI的一个很大的保证金。
英文摘要:
Given two collections of set objects $R$ and $S$, the $R \bowtie_{\subseteq} S$ set containment join returns all object pairs $(r, s) \in R \times S$ such that $r \subseteq s$. Besides being a basic operator in all modern data management systems with a wide range of applications, the join can be used to evaluate complex SQL queries based on relational division and as a module of data mining algorithms. The state-of-the-art algorithm for set containment joins (PRETTI) builds an inverted index on the right-hand collection $S$ and a prefix tree on the left-hand collection $R$ that groups set objects with common prefixes and thus, avoids redundant processing. In this paper, we present a framework which improves PRETTI in two directions. First, we limit the prefix tree construction by proposing an adaptive methodology based on a cost model; this way, we can greatly reduce the space and time cost of the join. Second, we partition the objects of each collection based on their first contained item, assuming that the set objects are internally sorted. We show that we can process the partitions and evaluate the join while building the prefix tree and the inverted index progressively. This allows us to significantly reduce not only the join cost, but also the maximum memory requirements during the join. An experimental evaluation using both real and synthetic datasets shows that our framework outperforms PRETTI by a wide margin.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。