Divide-and-Conquer Algorithm for Computing Set Containment Joins (Extended 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 for computing set containment joins efficiently. The first algorithm called Lattice Set Join is a partitioning-based version of an existing main-memory algorithm. The second one is a novel algorithm that we call Divide-and-Conquer Set Join. We show that the divide-and-conquer approach outperforms 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.

Available Versions of this Item

• Divide-and-Conquer Algorithm for Computing Set Containment Joins (Extended Technical Report). (deposited 20 Sep 2001 17:00) [Currently Displayed]
  • Divide-and-Conquer Algorithm for Computing Set Containment Joins. (deposited 14 Jan 2002 16:00)