Threshold Values for Processing Distributed Queries

A strategy to process a distributed query is formed using estimates of intermediate result sizes and delays due to network data transfer and CPU processing. Strategy execution is monitored, and corrected if observed parameter values differ substantially from their estimates. This paper presents and compares two methods which can be used to decide when to correct a strategy. In the reformulation method, a new strategy is formulated following each relational operation. The threshold method, on the other hand, is based on the fact that some intermediate results are more 'critical' than others. The query-processing strategy is represented as a network of activities, and the critical path method is used to determine threshold values for intermediate results. If an intermediate result is delayed beyond its threshold value, the strategy is corrected. The reformulation and threshold methods are evaluated on a test-bed of queries for a modelled application of a distributed database.

[1]  Georg Gottlob,et al.  Optimizing Joins between Two Partitioned Relations in Distributed Databases , 1986, J. Parallel Distributed Comput..

[2]  Clement T. Yu,et al.  Adaptive techniques for distributed query optimization , 1986, 1986 IEEE Second International Conference on Data Engineering.

[3]  Nicola Santoro,et al.  Improving Semi-Join Evaluation in Distributed Query Processing , 1987, ICDCS.

[4]  Peter Bodorik,et al.  Distributed query processing optimization objectives , 1988, Proceedings. Fourth International Conference on Data Engineering.

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

[6]  Andreas Reuter.  Load control and load balancing in a shared database management system , 1986, 1986 IEEE Second International Conference on Data Engineering.

[7]  Yahiko Kambayashi,et al.  Efficient processing of distributed set queries , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[8]  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.

[9]  R. Gagliardi,et al.  An operational approach to the integration of distributed heterogeneous environments , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[10]  Anant Jhingran.  A Performance Study of Query Optimization Algorithms on a Database System Supporting Procedures , 1988, VLDB.

[11]  N. G. Toan.  Distributed Query Management for a Local Network Database System , 1981, ICDCS.

[12]  Clement T. Yu,et al.  Some Esitmation Problems in Distributed Query Processing , 1982, ICDCS.

[13]  Peter Bodorik,et al.  Dynamic distributed query processing techniques , 1989, CSC '89.

[14]  Toshihide Ibaraki,et al.  Shortest Semijoin Schedule for a Local Area Distributed Database System , 1987, IEEE Transactions on Software Engineering.

[15]  Henk M. Blanken,et al.  Estimating bucket accesses: A practical approach , 1986, 1986 IEEE Second International Conference on Data Engineering.

[16]  David A. Bell,et al.  Pragmatic estimation of join sizes and attribute correlations , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

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

[18]  Michael Stonebraker,et al.  Analysis of Distributed Data Base Processing Strategies , 1980, VLDB.

[19]  Victor O K Li,et al.  QUERY PROCESSING IN DISTRIBUTED DATA BASES , 1981 .

[20]  Doron Rotem,et al.  Simple Random Sampling from Relational Databases , 1986, VLDB.

[21]  Toshihide Ibaraki,et al.  On the optimal nesting order for computing N-relational joins , 1984, TODS.

[22]  Michael Stonebraker.  The INGRES Papers: Anatomy of a Relational Database System , 1986 .

[23]  Eugene Wong,et al.  A state transition model for distributed query processing , 1986, TODS.

[24]  Peter Bodorik,et al.  Heuristic Algorithms For Distributed Query Processing , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.

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

[26]  Arie Tzvieli,et al.  Query processing for integrated systems , 1990, Systems Integration '90. Proceedings of the First International Conference on Systems Integration.

[27]  Timos K. Sellis,et al.  Multiple-query optimization , 1988, TODS.

[28]  Csaba J. Egyhazy,et al.  Estimating temporary files sizes in distributed realtional database systems , 1986, 1986 IEEE Second International Conference on Data Engineering.

[29]  Csaba J. Egyhazy,et al.  A Query Processing Algorithm for Distributed Relational Database Systems , 1988, Comput. J..

[30]  Clement T. Yu.  Distributed Database Query Processing , 1985, Query Processing in Database Systems.

[31]  Patricia G. Selinger,et al.  Access Path Selection in Distributed Database Management Systems , 1980, ICOD.

[32]  Said Rahimi,et al.  Local query translation and optimization in a distributed system , 1899 .

[33]  Yao-Tin Yu,et al.  An Analytical Method for Estimating and Interpreting Query Time , 1987, VLDB.

[34]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[35]  Won Kim,et al.  Global Optimization of Relational Queries: A First Step , 1985, Query Processing in Database Systems.

[36]  Dina Bitton,et al.  Estimating Block Accessses when Attributes are Correlated , 1986, VLDB.

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

[38]  J. Spruce Riordon,et al.  Distributed Database Partitioning and Query Processing , 1979, IFIP TC-2 Working Conference on Data Base Architecture.

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

[40]  Peter Bodorik,et al.  Evaluation dynamic processing of distributed queries , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[41]  Clement T. Yu,et al.  On the design of a query processing strategy in a distributed database environment , 1983, SIGMOD '83.

[42]  Sang Hyuk Son.  An environment for prototyping real-time distributed databases , 1990, Systems Integration '90. Proceedings of the First International Conference on Systems Integration.

[43]  Michael Stonebraker,et al.  The effect of join selectives on optimal nesting order , 1987, SGMD.

[44]  Hongjun Lu,et al.  Dynamic Task Allocation in a Distributed Database System , 1985, ICDCS.

[45]  Dean Daniels,et al.  Query Processing in R* , 1985, Query Processing in Database Systems.

[46]  Joseph Horowitz.  Critical path scheduling : management control through CPM and PERT , 1980 .

[47]  Eugene Wong,et al.  A statistical approach to incomplete information in database systems , 1982, TODS.