Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Quickly generating billion-record synthetic databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
On the complexity of join predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamically Optimizing High-Dimensional Index Structures
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Set Containment Joins: The Good, The Bad and The Ugly
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms and applications for universal quantification in relational databases
Information Systems - Special issue: Best papers from EDBT 2002
Adaptive algorithms for set containment joins
ACM Transactions on Database Systems (TODS)
Processing frequent itemset discovery queries by division and set containment join operators
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
SQL query optimization through nested relational algebra
ACM Transactions on Database Systems (TODS)
Using prefix-trees for efficiently computing set joins
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
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 a novel partitioning algorithm called Divide-and-Conquer Set Join (DCJ) for computing set containment joins efficiently. 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 DCJ and previously known algorithms and describe their behavior in an implemented testbed.