The Community for Technology Leaders
Green Image
<p>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.</p>
simulation results; distributed query processing; partition-and-replicate strategy; fragmented relation; fast local network environments; semijoins; database theory; distributed databases; local area networks; query languages
A.L.P. Chen, D. Brill, K.-C. Guh, C.T. Yu, "Partition Strategy for Distributed Query Processing in Fast Local Networks", IEEE Transactions on Software Engineering, vol. 15, no. , pp. 780-793, June 1989, doi:10.1109/32.24731
88 ms
(Ver 3.3 (11022016))