Randomized Algorithms for Optimizing Large Join Queries

@inproceedings{Ioannidis1990RandomizedAF,
  title={Randomized Algorithms for Optimizing Large Join Queries},
  author={Yannis E. Ioannidis and Younkyung Cha Kang},
  booktitle={SIGMOD Conference},
  year={1990}
}
Query optimization for relational database systems is a combinatorial optimization problem, which makes exhaustive search unacceptable as the query size grows. Randomized algorithms, such as Simulated Annealing (SA) and Iterative Improvement (II), are viable alternatives to exhaustive search. We have adapted these algorithms to the optimization of project-select-join queries. We have tested them on large queries of various types with different databases, concluding that in most cases SA… CONTINUE READING
Highly Influential
This paper has highly influenced 28 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
225 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 225 extracted citations

Similar Papers

Loading similar papers…