Loading...
Please wait, while we are loading the content...
Similar Documents
An Eecient Algorithm for Processing Distributed Queries with the Existence of Partition Dependency
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chen, Hao Liu, Chengwen |
| Copyright Year | 2007 |
| Abstract | We present an eecient algorithmfor processing distributed queries with the existence of partition dependency. For a given query, the algorithm rst partitions the referenced relations into a number of non-exclusive subsets such that the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of processing sites and can be used to generate an execution plan for the given query. Then, the algorithm determines a set of referenced fragmented relations not in the subset such that only the fragments instead of the whole relations are needed to be replicated at the processing sites. The other referenced relations are duplicated at each of the processing sites. Among the alternatives, the algorithm picks the plan that gives the minimum response time for the query. The experimental results show that our algorithm improves the performance of distributed query processing signiicantly. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://condor.depaul.edu/~hchen/cti.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
