
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.S. Chen, P.S. Yu, "A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 1, pp. 152165, February, 1994.  
BibTex  x  
@article{ 10.1109/69.273034, author = {M.S. Chen and P.S. Yu}, title = {A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {6}, number = {1}, issn = {10414347}, year = {1994}, pages = {152165}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.273034}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing IS  1 SN  10414347 SP152 EP165 EPD  152165 A1  M.S. Chen, A1  P.S. Yu, PY  1994 KW  distributed databases; query processing; graph theory; database theory; computational complexity; graph theoretical approach; join reducer sequence; distributed query processing; semijoin; data transmission; join operations; query graph; optimal sequence; exponential complexity; heuristic approaches; heuristic algorithms; polynomial time complexity VL  6 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Semijoin has traditionally been relied upon to reduce the cost of data transmission for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the amount of data transmission required. In view of this fact, we explore the approach of using join operations as reducers in distributed query processing. We first show that the problem of determining a sequence of join operations for a query can be transformed to that of finding a specific type of set of cuts to the corresponding query graph, where a cut to a graph is a partition of nodes in that graph. Then, in light of this concept, we prove that the problem of determining the optimal sequence of join operations for a given query graph is of exponential complexity, thus justifying the necessity of applying heuristic approaches to solve this problem. By mapping the problem of determining a sequence of join reducers into the one of finding a set of cuts, we develop (for tree and general query graphs, respectively) efficient heuristic algorithms to determine a join reducer sequence for distributed query processing. The algorithms developed are based on the concept of divide and conquer and are of polynomial time complexity. Simulation is performed to evaluate these algorithms.
[1] P. M. G. Apers, A. R. Hevner, and S. B. Yao, "Optimization algorithms for distributed queries,"IEEE Trans. Software Eng., vol. SE9, no. 1, pp. 5768, Jan. 1983.
[2] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 2540, Jan. 1981.
[3] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDDI),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[4] P. A. Black and W. S. Luk, "A new heuristic for generating semijoin programs for distributed query processing," inProc. IEEE COMPSAC, pp. 581588, 1982.
[5] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGrawHill, New York, 1984.
[6] A. L. P. Chen and V. O. K. Li, "Optimizing star queries in distributed database systems," inProc. 10th Int. Conf. Very Large Data Bases, 1984, pp. 429438.
[7] A. L. P. Chen and V. O. K. Li, "Improvement algorithms for semijoin query processing programs in distributed database systems,"IEEE Truns. Comput., vol. C33, no. 11, pp. 959967, Nov. 1984.
[8] M.S. Chen and P. S. Yu, "Interleaving a join sequence with semijoins in distributed query processing,"IEEE Trans. Parallel Distributed Syst., vol. 3, no. 5, pp. 611621, Sept. 1992.
[9] M.S. Chen and P. S. Yu, "Combining join and semijoin operations for distributed query processing,"IEEE Trans. Knowledge Data Eng., vol. 5, no. 3, pp. 534542, June 1993.
[10] M.S. Chen, P. S. Yu, and K. L. Wu, "Scheduling and processor allocation for parallel execution of multijoin queries," inProc. 8th Int. Conf. Data Engineeringpp. 5867, Feb. 1992.
[11] D.M. Chiu, P. A. Bernstein, and Y.C. Ho, "Optimizing chain queries in a distributed database system,"SIAM J. Comput., vol. 13, pp. 116134, Feb. 1984.
[12] S. Even,Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
[13] D. Gardy and C. Puech, "On the effect of join operations on relation dizes,"ACM Trans. Database Syst., vol. 14, no. 4, pp. 574603, Dec. 1989.
[14] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[15] N. Goodman and 0. Shmueli. "The tree property is fundamental for query processing," inProc. ACM Symp. Principles of Database Systems. pp. 4048, 1982.
[16] G. Graefe,RuleBased Query Optimization in Extensible Database Svstems. Madison, WI: Computer Science Dept., Univ. WisconsinMadison, 724, Nov. 1987.
[17] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[18] A. Hevner, "The optimization of query processing in distributed database systems," Ph.D. dissertation, Purdue Univ., West Lafayette, IN, Dec. 1979.
[19] A. R. Hevner and S. B. Yao, "Query processing in distributed database systems,"IEEE Trans. Software Eng., vol. SE5, no. 5, pp. 177187, May 1979.
[20] Y. E. Ioannidis and S. Christodoulakis, "On the propagation of errors in the size of join results," inProc. ACM SIGMOD, pp. 268277, May 1991.
[21] Y. Kambayashi, M. Yashikawa, and S. Yajima, "Query processing for distributed databases using generalized semijoins," inACM Proc. SIGMOD. pp. 151160, 1982.
[22] S. Lafortune and E. Wong, "A state transition model for distributed query processing,"ACM Trans. Database Syst., vol. 11, pp. 294 322, Sept. 1986.
[23] B. CharronBost, "Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory," inDistributed Algorithms, J.C. Bermond and M. Raynal. eds.,Lecture Notes in Computer Science, Vol. 392, SpringerVerlag, Berlin, 1989.
[24] G. M. Lohman,et al., "Query processing in R*," IBM Almaden Research Laboratory, San Jose, CA., RJ 4272, Apr. 1984.
[25] C. Mohan,Tutorial: Recent Advances in Distributed Data Base Management. New York: IEEE Computer Society, 1984.
[26] S. Pramanik and D. Vineyard, "Optimizing join queries in distributed databases,"IEEE Trans. Software Eng., vol. 14, no. 9, pp. 13191326, Sept. 1988.
[27] A. Segev, "Global heuristic for distributed query optimization," inProc. IEEE INFOCOM, pp. 388394, 1986.
[28] P. G. Selinger and M. E. Adiba, "Access path selection in distributed database management systems," inProc. Int. Conf. Databases. pp. 204215, 1980.
[29] C. Wang, "The complexity of processing tree queries in distributed databases," inProc. 2nd IEEE Symp. Parallel and Distributed Processing, pp. 604611, Dec. 1990.
[30] H. Yoo and S. Lafortune, "An intelligent search method for query optimization by semijoins,"IEEE Trans. Knowledge Data Eng., vol. 1, no. 2, pp. 226237, June 1989.
[31] C. Yu and C. Chang, "Distributed query processing,"ACM Comput. Surveys, vol. 16, no. 4, pp. 399433, Dec. 1984.
[32] C. Yu, Z. Ozsoyoglu, and K. Lam, "Optimization of distributed tree queries,"J. Comput. Syst. Sci., vol. 29, no. 3, pp. 409445, Dec. 1984.
[33] P. S. Yu, M.S. Chen, H. Heiss, and S. H. Lee, "On workload characterization of relational database environments,"IEEE Trans. Software Eng., vol. 18, no. 4, pp. 347355, Apr. 1992.