| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Yu,C.T.;Keh-Chang Guh;Brill, D;Chen,Arbee L. P. | en_US |
| dc.date (日期) | 1989-06 | en_US |
| dc.date.accessioned | 28-Aug-2014 10:08:34 (UTC+8) | - |
| dc.date.available | 28-Aug-2014 10:08:34 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-Aug-2014 10:08:34 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69375 | - |
| dc.description.abstract (摘要) | A partition-and-replicate strategy for processing distributed queries referencing no fragmented relation is sketched. An algorithm is given to determine which relation and which copy of the relation is to be partitioned into fragments, how the relation is to be partitioned, and where the fragments are to be sent for processing. Simulation results show that the partition strategy is useful for processing queries in fast local network environments. The results also show that the number of partitions does not need to be large. The use of semijoins in the partition strategy is discussed. A necessary and sufficient condition for a semijoin to yield an improvement is provided | en_US |
| dc.format.extent | 281 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Software Engineering (SCI,EI),780-793 | en_US |
| dc.title (題名) | Partition strategy for distributed query processing in fast local networks | en_US |
| dc.type (資料類型) | article | en |
