{"title":"哈希半连接:一种最小化分布式查询时间的新技术","authors":"T. Chen, A.L.P. Chen, Wei-Pang Yang","doi":"10.1109/FTDCS.1992.217477","DOIUrl":null,"url":null,"abstract":"Traditional semijoin and semijoin with multiple hash functions are two important methods to reduce the data transmission cost in distributed DBMS. However, these two methods are sometimes inefficient, due to their complexity and lack of flexibility. To remedy these problems, the authors propose a new technique, named hash-semijoin. They identify the situations in which it performs better than traditional semijoin and semijoin with multiple hash functions. The optimal hash functions used in hash-semijoins are also studied.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Hash-semijoin: a new technique for minimizing distributed query time\",\"authors\":\"T. Chen, A.L.P. Chen, Wei-Pang Yang\",\"doi\":\"10.1109/FTDCS.1992.217477\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional semijoin and semijoin with multiple hash functions are two important methods to reduce the data transmission cost in distributed DBMS. However, these two methods are sometimes inefficient, due to their complexity and lack of flexibility. To remedy these problems, the authors propose a new technique, named hash-semijoin. They identify the situations in which it performs better than traditional semijoin and semijoin with multiple hash functions. The optimal hash functions used in hash-semijoins are also studied.<<ETX>>\",\"PeriodicalId\":186762,\"journal\":{\"name\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1992.217477\",\"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 of the Third Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1992.217477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hash-semijoin: a new technique for minimizing distributed query time
Traditional semijoin and semijoin with multiple hash functions are two important methods to reduce the data transmission cost in distributed DBMS. However, these two methods are sometimes inefficient, due to their complexity and lack of flexibility. To remedy these problems, the authors propose a new technique, named hash-semijoin. They identify the situations in which it performs better than traditional semijoin and semijoin with multiple hash functions. The optimal hash functions used in hash-semijoins are also studied.<>