{"title":"用于非常大的关系数据库的多处理器组织","authors":"J. Zhu, J. Han, A. Hurson","doi":"10.1109/MWSCAS.1991.251974","DOIUrl":null,"url":null,"abstract":"The authors present a decentralized architecture for a multiprocessor database machine which supports multiple-user, online, very large relational database systems. A corresponding processor allocation strategy is proposed which applies the dataflow technique to distribute processors across all nodes of the vertically layered query tree and to pipeline pages of intermediate relation between them. Simulations show that the query execution time is 20%-25% less than that in the DIRECT database machine. The time used to process the messages in the authors' database machine is almost 40% less than the time used in DIRECT. The simulation also indicated that the machine's structure is less sensitive to the I/O bound than the DIRECT machine.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"41 1","pages":"970-973 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A multiprocessor organization for very large relational database\",\"authors\":\"J. Zhu, J. Han, A. Hurson\",\"doi\":\"10.1109/MWSCAS.1991.251974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a decentralized architecture for a multiprocessor database machine which supports multiple-user, online, very large relational database systems. A corresponding processor allocation strategy is proposed which applies the dataflow technique to distribute processors across all nodes of the vertically layered query tree and to pipeline pages of intermediate relation between them. Simulations show that the query execution time is 20%-25% less than that in the DIRECT database machine. The time used to process the messages in the authors' database machine is almost 40% less than the time used in DIRECT. The simulation also indicated that the machine's structure is less sensitive to the I/O bound than the DIRECT machine.<<ETX>>\",\"PeriodicalId\":6453,\"journal\":{\"name\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"volume\":\"41 1\",\"pages\":\"970-973 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1991.251974\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.251974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multiprocessor organization for very large relational database
The authors present a decentralized architecture for a multiprocessor database machine which supports multiple-user, online, very large relational database systems. A corresponding processor allocation strategy is proposed which applies the dataflow technique to distribute processors across all nodes of the vertically layered query tree and to pipeline pages of intermediate relation between them. Simulations show that the query execution time is 20%-25% less than that in the DIRECT database machine. The time used to process the messages in the authors' database machine is almost 40% less than the time used in DIRECT. The simulation also indicated that the machine's structure is less sensitive to the I/O bound than the DIRECT machine.<>
![[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
