File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient Processing of Joins on Set-valued Attributes

TitleEfficient Processing of Joins on Set-valued Attributes
Authors
Issue Date2003
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod
Citation
Proceedings Of The Acm Sigmod International Conference On Management Of Data, 2003, p. 157-168 How to Cite?
AbstractObject-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.
Persistent Identifierhttp://hdl.handle.net/10722/93486
ISSN

 

DC FieldValueLanguage
dc.contributor.authorMamoulis, Nen_HK
dc.date.accessioned2010-09-25T15:02:36Z-
dc.date.available2010-09-25T15:02:36Z-
dc.date.issued2003en_HK
dc.identifier.citationProceedings Of The Acm Sigmod International Conference On Management Of Data, 2003, p. 157-168en_HK
dc.identifier.issn0730-8078en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93486-
dc.description.abstractObject-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.en_HK
dc.languageengen_HK
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmoden_HK
dc.relation.ispartofProceedings of the ACM SIGMOD International Conference on Management of Dataen_HK
dc.titleEfficient Processing of Joins on Set-valued Attributesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-1142267356en_HK
dc.identifier.hkuros81304en_HK
dc.identifier.spage157en_HK
dc.identifier.epage168en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats