Adaptive Algorithms for Set Containment Joins (Technical Report)

Abstract

A set containment join is a join between set-valued attributes of two relations, whose join condition is specified using the subset operator. Set containment joins are used in a variety of database applications. In this paper, we propose two partitioning algorithms, called the Adaptive Pick-and-Sweep Join and the Adaptive Divide-and-Conquer Join, for computing set containment joins efficiently. We show that our algorithms outperform previously suggested algorithms over a wide range of data sets. We present a detailed analysis of the algorithms and describe their behavior in an implemented testbed.