一种计算数据库关系传递闭包的并行处理策略

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77115

Keh-Chang Guh

{"title":"一种计算数据库关系传递闭包的并行处理策略","authors":"Keh-Chang Guh","doi":"10.1109/PARBSE.1990.77115","DOIUrl":null,"url":null,"abstract":"A strategy for parallel computation of transitive closure of a database relation is given. It uses a hashing technique for horizontal data partitioning to achiev high parallelism with a simple scheme of message passing. A performance analysis shows that the strategy may achieve high parallelism with small communication overhead.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A parallel processing strategy for computing transitive closure of a database relation\",\"authors\":\"Keh-Chang Guh\",\"doi\":\"10.1109/PARBSE.1990.77115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A strategy for parallel computation of transitive closure of a database relation is given. It uses a hashing technique for horizontal data partitioning to achiev high parallelism with a simple scheme of message passing. A performance analysis shows that the strategy may achieve high parallelism with small communication overhead.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

给出了一种数据库关系传递闭包的并行计算策略。它使用哈希技术进行水平数据分区，通过简单的消息传递方案实现高并行性。性能分析表明，该策略可以在较小的通信开销下实现高并行性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A parallel processing strategy for computing transitive closure of a database relation

A strategy for parallel computation of transitive closure of a database relation is given. It uses a hashing technique for horizontal data partitioning to achiev high parallelism with a simple scheme of message passing. A performance analysis shows that the strategy may achieve high parallelism with small communication overhead.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量