面向共享内存机器的并行排序-哈希面向对象集合连接算法

D. Taniar, J. Rahayu
{"title":"面向共享内存机器的并行排序-哈希面向对象集合连接算法","authors":"D. Taniar, J. Rahayu","doi":"10.1080/10637190208941435","DOIUrl":null,"url":null,"abstract":"Collection join queries are join queries based on collection attributes (i.e. non-atomic attributes), which are common in object-oriented databases. We have identified three different kinds of collection join queries, namely; cullection-equi join, collection-intersect join, and sub-collection join. In this paper, we propose parallel join algorithms for these three collection join query types based on a combination of sort and hash methods, which we call parallel sort-hash, collection join algorithms. The proposed join algorithms play an important role in parallel object-oriented query processing, due to their superiority over the conventional join methods which are usually in a form of relational division, and also the inefficiency of the original join predicate processing. In our implementation of these algorithms on a shared-memory machine, we show that the combination between sort and hash methods is proven to be better than the conventional sort-merge and nested-loop based parallel join processing","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES\",\"authors\":\"D. Taniar, J. Rahayu\",\"doi\":\"10.1080/10637190208941435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collection join queries are join queries based on collection attributes (i.e. non-atomic attributes), which are common in object-oriented databases. We have identified three different kinds of collection join queries, namely; cullection-equi join, collection-intersect join, and sub-collection join. In this paper, we propose parallel join algorithms for these three collection join query types based on a combination of sort and hash methods, which we call parallel sort-hash, collection join algorithms. The proposed join algorithms play an important role in parallel object-oriented query processing, due to their superiority over the conventional join methods which are usually in a form of relational division, and also the inefficiency of the original join predicate processing. In our implementation of these algorithms on a shared-memory machine, we show that the combination between sort and hash methods is proven to be better than the conventional sort-merge and nested-loop based parallel join processing\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10637190208941435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10637190208941435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

集合连接查询是基于集合属性(即非原子属性)的连接查询,这在面向对象数据库中很常见。我们已经确定了三种不同类型的集合连接查询,即;集合-对等连接、集合-相交连接和子集合连接。本文针对这三种集合连接查询类型提出了基于排序和哈希方法组合的并行连接算法,我们称之为并行排序-哈希、集合连接算法。本文提出的连接算法在面向对象的并行查询处理中发挥着重要的作用,因为它优于传统的连接方法,而传统的连接方法通常采用关系划分的形式,并且降低了原始连接谓词处理的效率。在我们在共享内存机器上实现这些算法的过程中,我们证明了排序和哈希方法之间的组合比传统的排序合并和基于嵌套循环的并行连接处理要好
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PARALLEL SORT-HASH OBJECT-ORIENTED COLLECTION JOIN ALGORITHMS FOR SHARED-MEMORY MACHINES
Collection join queries are join queries based on collection attributes (i.e. non-atomic attributes), which are common in object-oriented databases. We have identified three different kinds of collection join queries, namely; cullection-equi join, collection-intersect join, and sub-collection join. In this paper, we propose parallel join algorithms for these three collection join query types based on a combination of sort and hash methods, which we call parallel sort-hash, collection join algorithms. The proposed join algorithms play an important role in parallel object-oriented query processing, due to their superiority over the conventional join methods which are usually in a form of relational division, and also the inefficiency of the original join predicate processing. In our implementation of these algorithms on a shared-memory machine, we show that the combination between sort and hash methods is proven to be better than the conventional sort-merge and nested-loop based parallel join processing
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信