This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Multiple-Query Optimization Problem
June 1990 (vol. 2 no. 2)
pp. 262-266

The complexity of the multiple-query optimization problem in database management systems is examined. It is shown that the problem is NP-hard. Then the authors examine the performance of a heuristic algorithm to solve the multiple-query optimization problem and suggest some heuristics for query ordering which improve the efficiency of the algorithm considerably. Some experimental results on the performance of various heuristics are also presented.

[1] H. Gallaire and J. Minker,Logic and Data Bases. New York: Plenum, 1978.
[2] M. R. Garey and D. S. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[3] J. Grant and J. Minker, "On optimizing the evaluation of a set of expressions,"Int. J. Comput. Inform. Sci., vol. 11, Mar. 1982.
[4] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[5] J. Park and A. Segev, "Using common subexpression to optimize multiple queries," inProc. 4th Int. Conf. Data Eng., Feb. 1988, pp. 311-319.
[6] J. Pearl,Heuristics. Reading, MA: Addison-Wesley, 1984.
[7] T. Sellis, "Multiple-query optimization,"ACM Trans. Database Syst., vol. 13, no. 1, Mar. 1988.
[8] T. Sellis and Y. C. Wong, "The implementation of a heuristic algorithm for the multiple-query optimization problem," unpublished manuscript, Dep. Comput. Sci., Univ. Maryland, College Park, Mar. 1988.

Index Terms:
deductive databases; algorithm complexity; 3SAT; multiple-query optimization; database management systems; NP-hard; heuristic algorithm; query ordering; efficiency; computability; computational complexity; database management systems; database theory; heuristic programming
Citation:
T. Sellis, S. Ghosh, "On the Multiple-Query Optimization Problem," IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 2, pp. 262-266, June 1990, doi:10.1109/69.54724
Usage of this product signifies your acceptance of the Terms of Use.