The article introduces two new algorithms, the Adaptive Pick-and-Sweep Join and the Adaptive Divide-and-Conquer Join, for efficiently computing set containment joins in databases. These algorithms have been shown to outperform previous methods across a wide range of data sets. The study provides a detailed analysis of the algorithms and demonstrates their effectiveness in a practical test environment.