具有并行半连接的循环查询的分布式优化

Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130) Pub Date : 1998-08-26 DOI:10.1109/DEXA.1998.707487

F. Najjar, Y. Slimani

{"title":"具有并行半连接的循环查询的分布式优化","authors":"F. Najjar, Y. Slimani","doi":"10.1109/DEXA.1998.707487","DOIUrl":null,"url":null,"abstract":"We consider the problem of finding (possibly optimal) semijoin sequences that (fully) reduce the relations referenced in a cyclic query graph. We propose a combination of parallel and sequential semijoin operations to minimize the amount of data transmission in distributed query processing. We report on experiments that show that our approach is not only efficient but also effective in reducing the total amount of data transmission.","PeriodicalId":194923,"journal":{"name":"Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)","volume":"236 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distributed optimization of cyclic queries with parallel semijoins\",\"authors\":\"F. Najjar, Y. Slimani\",\"doi\":\"10.1109/DEXA.1998.707487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of finding (possibly optimal) semijoin sequences that (fully) reduce the relations referenced in a cyclic query graph. We propose a combination of parallel and sequential semijoin operations to minimize the amount of data transmission in distributed query processing. We report on experiments that show that our approach is not only efficient but also effective in reducing the total amount of data transmission.\",\"PeriodicalId\":194923,\"journal\":{\"name\":\"Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)\",\"volume\":\"236 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEXA.1998.707487\",\"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 Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.1998.707487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们考虑寻找(可能是最优的)半连接序列的问题，这些序列(完全)减少了循环查询图中引用的关系。我们提出了并行和顺序半连接操作的组合，以尽量减少分布式查询处理中的数据传输量。我们报告的实验表明，我们的方法不仅是高效的，而且有效地减少了数据传输总量。

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

查看原文本刊更多论文

Distributed optimization of cyclic queries with parallel semijoins

We consider the problem of finding (possibly optimal) semijoin sequences that (fully) reduce the relations referenced in a cyclic query graph. We propose a combination of parallel and sequential semijoin operations to minimize the amount of data transmission in distributed query processing. We report on experiments that show that our approach is not only efficient but also effective in reducing the total amount of data transmission.

求助全文

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

来源期刊

Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)

自引率

0.00%

发文量