| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Chen,Arbee L. P;Li, V.O.K. | en_US |
| dc.date (日期) | 1985-10 | en_US |
| dc.date.accessioned | 28-八月-2014 10:08:42 (UTC+8) | - |
| dc.date.available | 28-八月-2014 10:08:42 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-八月-2014 10:08:42 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69378 | - |
| dc.description.abstract (摘要) | The problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for a special type of queries called star queries, we have developed a polynomial optimal algorithm. Semijoin tactics are applied for query processing. An execution graph is introduced to represent the semijoin programs associated with the distributed processing of the queries. We then identify optimality properties of semijoin programs for star queries, and use these properties to derive the optimal semijoin program. We have shown that the optimal semijoin program can be found from serial semijoin strategies, defined as serial semijoin programs which include each semijoin associated with the query exactly once. By making certain assumptions on the file sizes and the semijoin selectivities, we can obtain the optimal semijoin program from these strategies in polynomial time. Our assumption on selectivites is consistent in the sense that we consider the selectivity of a semijoin based on the current database state, i.e., we take into consideration the reduction effects of all prior semijoins. | en_US |
| dc.format.extent | 162 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Software Engineering (SCI,EI),1097-1107 | en_US |
| dc.title (題名) | An Optimal Algorithm for Processing Distributed Star Queries | en_US |
| dc.type (資料類型) | article | en |
