Partition strategy for distributed query processing in fast local networks

• Published in: IEEE transactions on software engineering Vol. 15; no. 6; pp. 780 - 793
• Main Authors: Yu, C.T., Guh, K.-C., Brill, D., Chen, A.L.P.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.06.1989; Institute of Electrical and Electronics Engineers; IEEE Computer Society
• Subjects: Algorithms; Applied sciences; Computer engineering; Computer programming; Computer science; Computer science; control theory; systems; Costs; Data communication; Distributed processing; Electrical engineering; Exact sciences and technology; Information science; Information systems. Data bases; Intelligent networks; Local area networks; Memory organisation. Data processing; Parallel processing; Partitioning algorithms; Performance analysis; Queries; Query processing; Relational data bases; Relational databases; Response time; Software; Sufficient conditions; Parallel processing; Distributed system; Database query; Distributed database; Optimization; Local network
• ISSN: 0098-5589; 1939-3520
• DOI: 10.1109/32.24731

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.< >