Query optimization by simulated annealing

ACM SIGMOD Record

Volumn 16, Issue 3, 1987, Pages 9-22

  Ioannidis, Yannis E ^a   Wong, Eugene ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976754569     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/38714.38722     Document Type: Article

References (45)

1. Ackley, D. H., G. E. Hinton, and T. J. Sejnowski, “A Learning Algorithm for Boltzmann Machines”, Cognitive Science 9 (1985), pp. 147– 169.
2. Aho, A., Y. Sagiv, and J. Ullman, “Equivalences Among Relational Expressions”, SIAM Computing Journal 8,2 (May 1979), pp 218–246.
3. Aho, A., J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, MA, 1974.
4. Aragon, C. R., D. S. Johnson, L. A. Megeoch, and C. Schevon, “Optimization by Simulated Annealing: An Experimental Evaluation”, unpublished manuscript, October 1984.
5. Astrahan M. et al., “System R* Relational Approach to Database Management”, ACM Transactions on Database Systems 1, 2 (June 1976), pp 97–137.
6. Bancilhon F., “Naive Evaluation of Recursively Defined Relations”, in Proceedings of the Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems, Islamorada, FL, February 1985.
7. Bancilhon, F., D. Maier, Y. Sagiv, and J. D. Ullman, “Magic Sets and Other Strange Ways to Implement Logic Programs”, in Proceedings of the 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, Boston, MA, March 1986, pp 1–15.
8. Bancilhon, F. and R. Ramakrishnan, “An Amateur's Introduction to Recursive Query Processing Strategies”, in Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data, Washington, DC., May 1986, pp. 16–52.
9. Bancilhon F. and R. Ramakrishnan, “Performance Evaluation of Data Intensive Logic Programs”, in Preprints of the Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC., August 1986, pp 284–314.
10. Bernstein, P. A., N. Goodman, E. Wong, C. L. Reeve, and J. B. Rothnie, “Query Processing in a System for Distributed Databases (SDD-1)”, ACM TODS 6,4 (December 1981), pp. 602–625.
11. Blasgen, M. W. and K. P. Eswaran, “On the Evaluation of Queries in a Relational Data Base System”, Research Report RJ-1745, IBM San Jose, April 1976.
12. Codd E. F., “A Relational Model of Data for Large Shared Data Banks”, CACM 13, 6 (1970), pp. 377–387.
13. Epstein, R., M. Stonebraker, and E. Wong, “Distnbuted Query Processing in a Relational Data Base System”, in Proceedings of the 1978 ACM-SIGMOD Conference on the Management of Data, Austin, TX, May 1978, pp 169–180.
14. Gallaire H. and J. Minker, Logic and Data Bases, Plenum Press, New York, N.Y, 1978.
15. Gallaire H., J. Minker, and J. M. Nicolas, “Logic and Databases: A Deductive Approach”, ACM Computing Surveys 16, 2 (June 1984), pp 153– 185.
16. J. Grant and J. Minker, “Optimization in Deductive and Conventional Relational Databases”, in Advances in Data Base Theory, Vol 1, Plenum Press, New York, N Y, 1981, pp 195–234.
17. Hajek, B., “Cooling Schedules for Optimal Annealing”, unpublished manuscnpt, January 1985.
18. Ioanmdis, Y. E., “On the Computation of the Transitive Closure of Relational Operators”, in Proc 12th International VLDB Conference, Kyoto, Japan, August 1986, pp. 403–411.
19. Ioannidis, Y. E. and E. Wong, “An Algebraic Approach to Recursive Inference”, in Proceedings of the 1st International Conference on Expert Database Systems, Charleston, South Carolina, April 1986, pp 209–223.
20. Ioanmdis, Y. E., “A Tune Bound on the Materialization of Some Recursively Defined Views”, Algorithmica 1,4 October 1986, pp 361–385.
21. Jarke, M. and J. Koch, “Query Optimization in Database Systems”, ACM Computing Surveys 16, 2 (June 1984), pp. 111–152.
22. Kerschberg, L., Expert Database Systems, Proceedings from the First International Workshop, Benjamin-Cummings, InC., Menlo Park, CA, 1986.
23. Kerschberg, L., Proceedings from the First International Conference on Expert Database Systems, Charleston, SC., April 1986.
24. Kim, W., D. Reiner, and D. Batory, Query Processing in Database Systems, Springer Verlag, 1986.
25. Kirkpatnck, S., C. D. Gelatt, Jr. and M. P. Vec-chi, “Optimization by Simulated Annealing”, Science 220,4598 (May 1983), pp. 671–680.
26. Kool, R. P., “The Optimization of Queries in Relational Databases”, PhD. Thesis, Case Western Reserve University, September 1980.
27. Knshnamurthy, R., H. Bond, and C. Zaniolo, “Optimization of Nonrecursive Queries”, in Proc 12th International VLDB Conference, Kyoto, Japan, August 1986, pp 128–137.
28. Mackert, L. F. and G. M. Lohman, “R* Validation and Performance Evaluation for Distributed Queries”, in Proc 12th International VLDB Conference, Kyoto, Japan, August 1986, pp 149–159.
29. Mackert, L. F. and G. M. Lohman, “R* Validation and Performance Evaluation for Local Queries”, in Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data, Washington, DC., May 1986, pp. 84–95.
30. Mitra, D., F. Romeo, and A. Sangiovanni-Vincentelli, “Convergence and Finite-Time Behavior of Simulated Annealing”, in Proc 24th Conference on Decision and Control, Ft. Lauderdale, FL, December 1985.
31. Naughton, J., “Optimizing Function-Free Recursive Inference Rules”, Computer Science Technical Report, Stanford University, Stanford, CA, May 1986.
32. Rich, E., Artificial Intelligence, McGraw-Hill, New York, N.Y., 1983.
33. Romeo, F., A. Sangiovanni-Vincentelli, and C. Sechen, “Research on Simulated Annealing at Berkeley”, in Proc 1984 IEEE International Conference on Computer Design, Port Chester, N.Y., October 1984, pp. 652–657.
34. Romeo, F. and A. Sangiovanni-Vincentelli, “Probabilistic Hill Climbing Algorithms: Properbes and Applications”, in Proc 1985 Chapel Hill Conference on VLSI, edited by H. Fuchs, Computer Science Press, Chapel Hill, N C., 1985, pp 393–417.
35. Rosenkrantz, D. J. and H. B. Hunt III, “Processing Conjunctive Predicates and Queries”, in Proc 6th International VLDB Conference, Montreal, Canada, October 1980, pp. 64–72.
36. Sacca, D. and C. Zaniolo, “The Generalized Counting Method for Recursive Logic Queries”, in Proceedings of the International Conference on Database Theory, Rome. Italy, October 1986
37. Sagiv, Y., “Optimizing Datalog Programs”, in Preprints of the Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC., August 1986, pp 136–162.
38. Sechen, C. and A. Sangiovanni-Vincentelli, “TimberWolf 3.2: A New Standard Cell Placement and Global Routing Package”, in Proc Design Automation Conference, Las Vegas, NV, June 1986.
39. Sechen, C., private communication, June 1986.
40. Selinger, P. et al., “Access Path Selection in a Relational Data Base System”, in Proceedings of the 1979 ACMSIGMOD Conference on the Management of Data, Boston, MA, June 1979, pp. 23–34.
41. Sellis, T. K., “Global Query Optimization”, in Proceedings of the 1986 ACMSIGMOD Conference on the Management of Data, Washington, DC., May 1986,191–205.
42. Stonebraker, M., E. Wong, P. Kreps, and G. Held, “The Design and Implementation of INGRES”, ACM Transactions on Database Systems 1, 3 (September 1976), pp. 189–222.
43. Valdunez, P. and H. Bond, “Evaluation of Recursive Queries Using Join Indices”, in Proceedings of the 1st International Conference on Expert Database Systems, Charleston, SC., April 1986, pp. 197–208.
44. Wilensky, R., LISPcraft, 1983.
45. Wong, E. and K. Youssefi, “Decomposition - A Strategy for Query Processing”, ACM Transactions on Database Systems 1,3 (September 1976), pp. 223–241.