{"title":"多数据库系统中嵌套循环操作的通信开销","authors":"A. Rafii","doi":"10.1109/RIDE.1992.227394","DOIUrl":null,"url":null,"abstract":"This paper summarizes some of the results from a previous paper by the author (see DTD Technical Memo HPL-DTD-91-5, HP Labs., 1991). The purpose is to characterize the interprocess communication (IPC) overhead in the context of multidatabase operations. A quantitative analysis of the cost of a distributed query is becoming increasingly important as operations across multiple databases are becoming more common. A global nested-loop (NL) join method is one of the least-complicated methods for joining data across data sources. One of the advantages of the algorithm is that it works even when an external operation is a method call whose input parameters, unlike a query, must be bound at invocation time.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Communication overhead of nested loop operation in multidatabase system\",\"authors\":\"A. Rafii\",\"doi\":\"10.1109/RIDE.1992.227394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper summarizes some of the results from a previous paper by the author (see DTD Technical Memo HPL-DTD-91-5, HP Labs., 1991). The purpose is to characterize the interprocess communication (IPC) overhead in the context of multidatabase operations. A quantitative analysis of the cost of a distributed query is becoming increasingly important as operations across multiple databases are becoming more common. A global nested-loop (NL) join method is one of the least-complicated methods for joining data across data sources. One of the advantages of the algorithm is that it works even when an external operation is a method call whose input parameters, unlike a query, must be bound at invocation time.<<ETX>>\",\"PeriodicalId\":138660,\"journal\":{\"name\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1992.227394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1992.227394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文总结了作者之前一篇论文的一些结果(参见DTD技术备忘录HP -DTD-91-5, HP Labs)。, 1991)。目的是描述多数据库操作上下文中的进程间通信(IPC)开销。随着跨多个数据库的操作变得越来越普遍,对分布式查询的成本进行定量分析变得越来越重要。全局嵌套循环(NL)连接方法是跨数据源连接数据的最简单的方法之一。该算法的优点之一是,即使外部操作是一个方法调用,其输入参数(不像查询)必须在调用时绑定时,它也能工作。
Communication overhead of nested loop operation in multidatabase system
This paper summarizes some of the results from a previous paper by the author (see DTD Technical Memo HPL-DTD-91-5, HP Labs., 1991). The purpose is to characterize the interprocess communication (IPC) overhead in the context of multidatabase operations. A quantitative analysis of the cost of a distributed query is becoming increasingly important as operations across multiple databases are becoming more common. A global nested-loop (NL) join method is one of the least-complicated methods for joining data across data sources. One of the advantages of the algorithm is that it works even when an external operation is a method call whose input parameters, unlike a query, must be bound at invocation time.<>