Name
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. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/69.54724 | Knowledge and Data Engineering, IEEE Transactions |
Keywords | Field | DocType |
computability,computational complexity,database management systems,database theory,heuristic programming,3SAT,NP-hard,algorithm complexity,database management systems,deductive databases,efficiency,heuristic algorithm,multiple-query optimization,query ordering | Query optimization,Data mining,Computational problem,Heuristic (computer science),Computer science,Vector optimization,Theoretical computer science,Heuristics,Cutting stock problem,Optimization problem,Computational complexity theory | Journal |
Volume | Issue | ISSN |
2 | 2 | 1041-4347 |
Citations | PageRank | References |
67 | 15.95 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Timos K. Sellis | 1 | 4970 | 1255.07 |
| Subrata Ghosh | 2 | 67 | 15.95 |