題名: | 一個以目標關係為基礎的分散聯結運算方式 |
其他題名: | A Target-Relation-Based Approach to Distributed Joins |
作者: | 張玉盈 劉博敏 |
關鍵字: | distributed databases heuristic joins query optimization relational databases semijoins 分散式資料庫 啟發式演算法 查詢最佳化 關係式資料庫 半聯結 |
期刊名/會議名稱: | 1995 NCS會議 |
摘要: | A target relation of a query is a relation which contains attributes of selected tuples to be outputted. In this paper, by identifying target relations, we divide a given tree query into two parts: one final query tree and zero or more non-final query trees. Since only the root of each of the non-final query trees will participate in the final query tree, we can apply a semi join program to fully reduce the size of the root of each of the non-final trees first. Therefore, we can reduce the data transmission cost for the final query tree. Moreover, when there is more than one non-final query trees, we can process them in parallel, which can shorten the query response time. Then, we apply join and semi join operations together to optimize the cost of the final query tree, Consequently, our target-relation-based approach not only can reduce the data transmission cost but also the response time. Moreover, the larger the number of non-final query trees is, the more reduction our approach can achieve. We show that the proposed approach to distributed joins can have better performance than other approaches which either apply semi joins before the join process or apply both joins and semi joins together. |
日期: | 2007-01-12T07:32:18Z |
分類: | 1995年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ncs001995000058.pdf | 474.05 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。