| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Wang,Chhping;Li,Victor OK;Chen,Arbee LP | en_US |
| dc.date (日期) | 1993 | en_US |
| dc.date.accessioned | 28-八月-2014 10:15:43 (UTC+8) | - |
| dc.date.available | 28-八月-2014 10:15:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-八月-2014 10:15:43 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69388 | - |
| dc.description.abstract (摘要) | We apply the one shot semi-join execution strategy, which allows parallelism and processes multiple semi-joins simultaneously, to optimize the transmission cost of distributed queries. The query optimization problem based on this strategy is NP-hard. Nevertheless, in practice most of the parameters needed for query optimization, such as relation cardinality and selectivity, are of fixed-precision, i.e. their binary representations have no more than a fixed number of digits after the binary point. Imposing this fixed-precision constraint, we develop an efficient distributed query processing algorithm. For situations where the fixed-precision constraint doe not apply, we propose a method to truncate the parameters and use the same algorithm to find near-optimal solutions. By analyzing the truncation errors, we provide a quantitative comparison between the near-optimal solutions and the optimal ones. | en_US |
| dc.format.extent | 101 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Computer Systems Science And Engineering,8(4),245-253 | en_US |
| dc.title (題名) | One-shots emi-join execution strategies for processing distributed join queries | en_US |
| dc.type (資料類型) | article | en |
