{"title":"基于集群的混合哈希连接:分析和评估","authors":"E. Schikuta, Peter Kirkovits","doi":"10.1109/CLUSTR.2002.1137783","DOIUrl":null,"url":null,"abstract":"The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel hybrid hash join algorithm on a PC-cluster architecture and analyzed its performance behavior. We show that off-the-shelf cost saving cluster systems can build a viable platform for parallel database systems.","PeriodicalId":92128,"journal":{"name":"Proceedings. IEEE International Conference on Cluster Computing","volume":"49 1","pages":"461-466"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Cluster based hybrid hash join: analysis and evaluation\",\"authors\":\"E. Schikuta, Peter Kirkovits\",\"doi\":\"10.1109/CLUSTR.2002.1137783\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel hybrid hash join algorithm on a PC-cluster architecture and analyzed its performance behavior. We show that off-the-shelf cost saving cluster systems can build a viable platform for parallel database systems.\",\"PeriodicalId\":92128,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on Cluster Computing\",\"volume\":\"49 1\",\"pages\":\"461-466\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLUSTR.2002.1137783\",\"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. IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLUSTR.2002.1137783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cluster based hybrid hash join: analysis and evaluation
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel hybrid hash join algorithm on a PC-cluster architecture and analyzed its performance behavior. We show that off-the-shelf cost saving cluster systems can build a viable platform for parallel database systems.