On the multiple-query optimization problem
- 1 June 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 2 (2) , 262-266
- https://doi.org/10.1109/69.54724
Abstract
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.<>Keywords
This publication has 4 references indexed in Scilit:
- Using common subexpressions to optimize multiple queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Multiple-query optimizationACM Transactions on Database Systems, 1988
- On optimizing the evaluation of a set of expressionsInternational Journal of Parallel Programming, 1982
- Logic and Data BasesPublished by Springer Nature ,1978