Title :
Partition strategy for distributed query processing in fast local networks
Author :
Yu, Clement T. ; Guh, Keh-chang ; Brill, David ; Chen, Arbee L P
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fDate :
6/1/1989 12:00:00 AM
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
Keywords :
database theory; distributed databases; local area networks; query languages; distributed query processing; fast local network environments; fragmented relation; partition-and-replicate strategy; semijoins; simulation results; Costs; Data communication; Information science; Intelligent networks; Parallel processing; Partitioning algorithms; Performance analysis; Query processing; Relational databases; Sufficient conditions;
Journal_Title :
Software Engineering, IEEE Transactions on
