Review - Query Optimization by Simulated Annealing.
Timos K. Sellis:
Review - Query Optimization by Simulated Annealing.
ACM SIGMOD Digital Review 2: (2000) BibTeX
Review
Query optimization in modern database management systems faces in
many cases large access plan spaces. This papers addresses the case
of recursive queries where the optimization space is very large and
requires special treatment. I particularly liked this paper because
it introduced for the first time advanced optimization techniques,
in this case simulated annealing, to the problem of query
optimization. Simulated annealing is a probabilistic hill climbing
algorithm. The authors study in details the basic factors
influencing the performance of the algorithm and provide in a neat
and "educational" manner implementation issues. In my opinion this
is a model paper for people writing query optimization algorithm
papers, where sometime details are not presented and readers are
left with lots of questions.
Copyright © 2000 by the author(s).
Review published with permission.
References
- [1]
- Yannis E. Ioannidis, Eugene Wong:
Query Optimization by Simulated Annealing.
SIGMOD Conference 1987: 9-22 BibTeX
BibTeX
Digital Review - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Digital Review: Copyright © by ACM (info@acm.org),
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:57:28 2009
