On the multiple-query optimization problem
Timos Sellis, Subrata Kumar Ghosh · IEEE Transactions on Knowledge and Data Engineering · 1990
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.>
Cited by 113 works. doi:10.1109/69.54724
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Principles of Artificial Intelligence
- Principles of artificial intelligence
- Logic and Data Bases
- Multiple-query optimization
- Logic and Data Bases
- Using common subexpressions to optimize multiple queries
- On optimizing the evaluation of a set of expressions