Performance Issues in Distributed Query Processing

The authors discuss various performance issues in distributed query processing. They validate and evaluate the performance of the local reduction (LR) the fragment and replicate strategy (FRS) and the partition and replicate strategy (PRS) optimization algorithms. The experimental results reveal that the choices made by these algorithms concerning which local operations should be performed, which relation should remain fragmented or which relation should be partitioned are valid. It is shown using experimental results that various parameters, such as the number of processing sites, partitioning speed relative to join speed, and sizes of the join relations, affect the performance of PRS significantly. It is also shown that the response times of query execution are affected significantly by the degree of site autonomy, interferences among processes, interface with the local database management systems (DBMSs) and communications facilities. Pipeline strategies for processing queries in an environment where relations are fragmented are studied. >

[1]  Eugene Wong,et al.  Query processing in sdd-i: a system for distributed databases , 1979 .

[2]  Clement T. Yu,et al.  Query Processing in a Fragmented Relational Distributed System: Mermaid , 1985, IEEE Transactions on Software Engineering.

[3]  Clement T. Yu,et al.  Partition Strategy for Distributed Query Processing in Fast Local Networks , 1989, IEEE Trans. Software Eng..

[4]  David J. DeWitt,et al.  Benchmarking Database Systems A Systematic Approach , 1983, VLDB.

[5]  Jon Postel,et al.  User Datagram Protocol , 1980, RFC.

[6]  Guy M. Lohman,et al.  Optimizer Validation and Performance Evaluation for Distributed Queries , 1998 .

[7]  Jo-Mei Chang.  A Heuristic Approach to Distributed Query Processing , 1982, VLDB.

[8]  Michael Stonebraker,et al.  A Distributed Data Base Version of INGRES. , 1976 .

[9]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[10]  Terry A. Landers,et al.  An Overview of MULTIBASE , 1986, DDB.

[11]  Adel Said Elmaghraby,et al.  Letter to the editor , 2018, Journal of Orofacial Orthopedics-fortschritte Der Kieferorthopadie.

[12]  Benjamin W. Wah,et al.  Design of Distributed Databases on Local Computer Systems with a Multiaccess Network , 1985, IEEE Transactions on Software Engineering.

[13]  Hector Garcia-Molina,et al.  Node Autonomy In Distributed Systems , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[14]  Stanley Y. W. Su,et al.  A distributed query processing strategy using decomposition, pipelining and intermediate result sharing techniques , 1986, 1986 IEEE Second International Conference on Data Engineering.

[15]  Victor O. K. Li,et al.  Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network , 1989, IEEE Trans. Software Eng..

[16]  Stavros Christodoulakis,et al.  Estimating block transfers and join sizes , 1983, SIGMOD '83.

[17]  Stephen Fox,et al.  Overview of an Ada compatible distributed database manager , 1983, SIGMOD '83.

[18]  Elisa Bertino,et al.  Research Direction in Query Optimization at the University of Maryland. , 1982 .

[19]  Cyril U. Orji,et al.  A methodology for benchmarking distributed database management systems , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[20]  Guy M. Lohman,et al.  R* optimizer validation and performance evaluation for local queries , 1986, SIGMOD '86.

[21]  Michael Stonebraker,et al.  Distributed query processing in a relational data base system , 1978, SIGMOD Conference.

[22]  Bharat K. Bhargava,et al.  The Raid Distributed Database System , 1989, IEEE Trans. Software Eng..

[23]  Erich J. Neuhold,et al.  An Overview of the Architecture of the Distributed Data Base System "POREL" , 1982, DDB.

[24]  Clement T. Yu,et al.  Algorithms to Process Distributed Queries in Fast Local Networks , 1987, IEEE Transactions on Computers.

[25]  Clement T. Yu,et al.  Distributed query processing strategies in Mermaid, a frontend to data management systems , 1984, 1984 IEEE First International Conference on Data Engineering.

[26]  Robert E. Kahn,et al.  A Protocol for Packet Network Intercommunication , 1974 .

[27]  David J. DeWitt,et al.  A multiuser performance analysis of alternative declustering strategies , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[28]  Philip S. Yu,et al.  An effective algorithm for parallelizing sort merge joins in the presence of data skew , 1990, DPDS '90.

[29]  Tom W. Keller,et al.  Data placement in Bubba , 1988, SIGMOD '88.

[30]  Philip A. Bernstein,et al.  Using Semi-Joins to Solve Relational Queries , 1981, JACM.

[31]  Randy H. Katz,et al.  Distributing a database for parallelism , 1983, SIGMOD '83.

[32]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[33]  Philip S. Yu,et al.  An effective algorithm for parallelizing hash joins in the presence of data skew , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[34]  Bharat K. Bhargava,et al.  Implementation and measurements of efficient communication facilities for distributed database systems , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[35]  Arbee L. P. Chen,et al.  An Optimal Algorithm for Processing Distributed Star Queries , 1985, IEEE Transactions on Software Engineering.

[36]  Arie Segev,et al.  Set query optimization in distributed database systems , 1986, TODS.

[37]  Sakti Pramanik,et al.  Optimizing Join Queries in Distributed Databases , 1988, IEEE Trans. Software Eng..

[38]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[39]  Hongjun Lu,et al.  Some Experimental Results on Distributed Join Algorithms in a Local Network , 1985, VLDB.

[40]  Eugene Wong,et al.  Introduction to a system for distributed databases (SDD-1) , 1980, TODS.

[41]  David J. DeWitt,et al.  A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment , 1989, SIGMOD '89.

[42]  Stanley Y. W. Su,et al.  An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment , 1988, IEEE Trans. Software Eng..

[43]  P. Agrawal,et al.  A Case Study For Distributed Query Processing , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

[44]  Arbee L. P. Chen,et al.  Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems , 1984, IEEE Transactions on Computers.

[45]  Clement T. Yu,et al.  Distributed query processing , 1984, CSUR.

[46]  Stanley Y. W. Su,et al.  Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries , 1988, IEEE Trans. Software Eng..

[47]  Clement T. Yu,et al.  Experiences with distributed query processing , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[48]  Arie Segev,et al.  Optimization of join operations in horizontally partitioned database systems , 1986, TODS.

[49]  Sheldon J. Finkelstein.  Common expression analysis in database applications , 1982, SIGMOD '82.

[50]  S. B. Yao,et al.  Optimization Algorithms for Distributed Queries , 1986, IEEE Transactions on Software Engineering.

[51]  P. Rolin,et al.  SIRIUS System for Distributed Data Management , 1982, DDB.

[52]  David J. DeWitt,et al.  Chained declustering: a new availability strategy for multiprocessor database machines , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[53]  Clement T. Yu,et al.  Partitioning Relation for Parallel Processing in Fast Local Networks , 1986, ICPP.

[54]  Matthias Jarke,et al.  Common Subexpression Isolation in Multiple Query Optimization , 1984, Query Processing in Database Systems.

[55]  Don S. Batory,et al.  Modeling the storage architectures of commercial database systems , 1985, TODS.

[56]  Michael Stonebraker,et al.  The Case for Shared Nothing , 1985, HPTS.