This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Intelligent Search Method for Query Optimization by Semijoins
June 1989 (vol. 1 no. 2)
pp. 226-237

The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently: on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost mode considered, and ability to handle tree queries with arbitrary target lists.

[1] P. G. M. Apers, A. R. Hevner, and S. B. Yao, "Optimization algorithms for distributed queries,"IEEE Trans. Software Eng., vol. SE-9, pp. 57-68, Jan. 1983.
[2] A. Barr and E. A. Feigenbaum, Ed.,Handbook of Artificial Intelligence, Vol. 1.Los Altos, CA: William Kaufmann Inc., 1981.
[3] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[4] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 25-40, Jan. 1981.
[5] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[6] J. M. Chang, "A heuristic approach to distributed query processing," inProc. 8th Int. Conf. Very Large Data Bases, 1982, pp. 54- 61.
[7] 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. 429-438.
[8] D.-M. Chiu, P. A. Bernstein, and Y.-C. Ho, "Optimizing chain queries in a distributed database system,"SIAM J. Comput., vol. 13, pp. 116-134, Feb. 1984.
[9] D. Chiu and Y. Ho, "A methodology for interpreting tree queries into optimal semi-join expressions," inProc. ACM SIGMOD, May 1980, pp. 169-178.
[10] M. Gouda and U. Dayal, "Optimal semijoin schedules for query processing in local distributed database systems," inProc. Int. Conf. Management of Data, ACM, New York, 1981.
[11] J. Grant and J. Minker, "On optimizing the evaluation of a set of expressions," Univ. Maryland, College Park, Tech. Rep. TR-916, July 1980.
[12] P. E. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths,"IEEE Trans. Syst. Sci. Cybern., vol. SSC-4, pp. 100-107, July 1968.
[13] A. Hevner, "The optimization of query processing in distributed database systems," Ph.D. dissertation, Purdue Univ., West Lafayette, IN, Dec. 1979.
[14] A. R. Hevner and S. B. Yao, "Query processing in distributed database systems,"IEEE Trans. Software Eng., vol. SE-5, pp. 177- 187, May 1979.
[15] M. Jarke and J. Koch, "Query optimization in database systems,"ACM Comput. Surveys, vol. 16, no. 2, June 1984.
[16] H. Kang and N. Roussopoulos, "Combining joins and semijoins in distributed query processing," Univ. Maryland, College Park, Tech. Rep. CS-TR-1794, 1987.
[17] L. Kerschberg, P. D. Ting, and S. B. Yao, "Query optimization in star computer networks,"ACM Trans. Database Syst., vol. 7, Dec. 1982.
[18] W. Kim, D. S. Reiner, and D. S. Batory,Query Processing in Database Systems. New York: Springer-Verlag, 1985.
[19] S. Lafortune and E. Wong, "A state transition model for distributed query processing,"ACM Trans. Database Syst., vol. 11, pp. 294- 322, Sept. 1986.
[20] E. L. Lawler and D. E. Wood, "Branch-and-bound methods: A survey,"Oper. Res., vol. 14, pp. 699-719, July 1966.
[21] H. Lu, "Distributed query processing with load balancing in local area networks," Ph.D. dissertation, Univ. Wisconsin, Madison, 1985.
[22] L. F. Mackert and G. M. Lohman, "R*optimizer validation and performance evaluation for distributed queries," IBM Res. Lab., Tech. Rep. RJ 5050, Apr. 1986.
[23] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[24] J. T. Park, T. J. Teorey, and S. Lafortune, "A knowledge-based approach to multiple query processing,"J. Data Knowledge Eng., vol. 3, pp. 261-264, Feb. 1989.
[25] J. Pearl,Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Mass: Addison-Wesley, 1984.
[26] M. K. Vernon, E.D. Lazowska, and J. Zahorjan, "An accurate and efficient performance analysis technique for multiprocessor snooping cache-consistency protocols," inProc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, May 1988, pp. 308-315.
[27] T. Sellis, "Multiple-query optimization,"ACM Trans. Database Syst., vol. 13, no. 1, Mar. 1988.
[28] P. M. Winston,Artificial Intelligence. Reading, MA: Addison-Wesley, 1984.
[29] E. Wong, "Retrieving dispersed data from SDD-1 : A system for distributed databases," inProc. 2nd Berkeley Workshop Distributed Data Management and Comput. Networks, Lawrence Berkeley Lab., May 1977, pp. 217-235.
[30] H. Yoo, "Intelligent search in query optimization," Ph.D. dissertation, Univ. Michigan, Ann Arbor, 1989, in preparation.
[31] H. Yoo and S. Lafortune, "Distributed query processing as problem solving," Comput. Res. Lab., Univ. Michigan, Ann Arbor, Tech. Rep. CRL-TR-07-87, Aug. 1987.
[32] C. T. Yu and C. C. Chang, "On the design of a query processing strategy in a distributed database environment," inProc. 1983 ACM-SIGMOD Int. Conf. Management of Data, 1983, pp. 30-39.
[33] C. Yu and C. Chang, "Distributed query processing,"ACM Comput. Surveys, vol. 16, no. 4, pp. 399-433, Dec. 1984.
[34] C. Yu, Z. Ozsoyoglu, and K. Lam, "Optimization of distributed tree queries,"J. Comput. Syst. Sci., vol. 29, no. 3, pp. 409-445, Dec. 1984.

Index Terms:
intelligent navigation; intelligent search method; query optimization; optimal semijoin sequence; tree query; space; optimal solution; search space; cost mode; arbitrary target lists; distributed databases; information retrieval; knowledge engineering
Citation:
H. Yoo, S. Lafortune, "An Intelligent Search Method for Query Optimization by Semijoins," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 226-237, June 1989, doi:10.1109/69.87962
Usage of this product signifies your acceptance of the Terms of Use.