{"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}
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