| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Yu, C.T.;Guh,Keh-Chang; Weining Zhang ; Templeton, M. ; Brill,D;Chen,Arbee L. P. | en_US |
| dc.date (日期) | 1987-10 | en_US |
| dc.date.accessioned | 28-八月-2014 10:08:36 (UTC+8) | - |
| dc.date.available | 28-八月-2014 10:08:36 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-八月-2014 10:08:36 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69376 | - |
| dc.description.abstract (摘要) | We propose a scheme to make use of semantic information to process distributed queries locally without data transfer with respect to the join clauses of the query. Since not all queries can be processed without data transfer, we give an algorithm to recognize the "locally processable queries." For nonlocally processable queries, a simple "fragment and replicate" algorithm is used. The algorithm chooses a relation to remain fragmented at the sites where they are situated while replicating the other relations at those sites. Our algorithm determines the chosen relation and the chosen copy of every fragment of the chosen relation such that the minimum response time is obtained. The algorithm runs in linear time. If the fragments of the relation are allowed to be processed in other sites, then the problem is NP hard. Two heuristics are given for that situation. They are compared to the optimal situation. Experimental results show that the strategies produced by the heuristics have small errors relative to the optimal strategy. | en_US |
| dc.format.extent | 164 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Computers (SCI,EI),1153-1164 | en_US |
| dc.title (題名) | Algorithms to Process Distributed Queries in Fast Local Networks | en_US |
| dc.type (資料類型) | article | en |
