|
|
|
     |
                                     |
Return to Join Algorithms
Object-oriented and object-relational DBMS support set- valued attributes, which are a natural and concise way to model complex information. However, there has been limited research to-date on the evaluation of query operators that apply on sets. In this paper we study the join of two relations on their set-valued attributes. Various join types are considered, namely the set containment, set equality, and set overlap joins. We show that the inverted file, a powerful index for selection queries, can also facilitate the efficient evaluation of most join predicates. We propose join algorithms that utilize inverted files and compare them with signature-based methods for several set-comparison predicates.
@inproceedings {DBLP:conf/sigmod/Mamoulis03, author = {Nikos Mamoulis}, booktitle = {SIGMOD Conference}, title = {Efficient Processing of Joins on Set-valued Attributes.}, pages = {157-168}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#Mamoulis03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r06p02.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
