{"title":"并行数据库系统中的连接查询优化","authors":"A. Jhingran, S. Padmanabhan, A. Shatdal","doi":"10.1109/APADS.1993.588851","DOIUrl":null,"url":null,"abstract":"The authors present a new framework for studying query optimization. They first note that scheduling and optimization must go together in a parallel environment. They introduce the concept of response time envelopes which integrates scheduling and optimization. It is shown that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.","PeriodicalId":164521,"journal":{"name":"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Join query optimization in parallel database systems\",\"authors\":\"A. Jhingran, S. Padmanabhan, A. Shatdal\",\"doi\":\"10.1109/APADS.1993.588851\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a new framework for studying query optimization. They first note that scheduling and optimization must go together in a parallel environment. They introduce the concept of response time envelopes which integrates scheduling and optimization. It is shown that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.\",\"PeriodicalId\":164521,\"journal\":{\"name\":\"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APADS.1993.588851\",\"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 1993 IEEE Workshop on Advances in Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APADS.1993.588851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Join query optimization in parallel database systems
The authors present a new framework for studying query optimization. They first note that scheduling and optimization must go together in a parallel environment. They introduce the concept of response time envelopes which integrates scheduling and optimization. It is shown that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.