{"title":"Parallel processing and data driven implementation of a relational data base system","authors":"P. Chang","doi":"10.1145/800191.805606","DOIUrl":null,"url":null,"abstract":"A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '76","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800191.805606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.