Optimization Techniques for Queries with Expensive Methods

ACM Transactions on Database Systems

Volumn 23, Issue 2, 1998, Pages 113-157

  Hellerstein, Joseph M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Expensive methods; Extensibility; H.2.4 Database Management : Systems query processing; Object relational databases; Performance; Predicate Migration; Predicate placement; Query optimization; Theory

Indexed keywords

DATA TYPES; OBJECT-RELATIONAL SYSTEMS; PREDICATE MIGRATION; QUERY OPTIMIZERS;

ALGORITHMS; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION;

QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS;

PREDICATE MANAGEMENT ALGORITHM;

EID: 0032083881     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/292481.277627     Document Type: Article

References (61)

1. BITTON, D., DEWITT, D. J., AND TURBYFILL, C. 1983. Benchmarking database systems, a systematic approach. In Proceedings of the Ninth International Conference on Very Large Data Bases (Florence).
2. CAREY, M. J., DEWITT, D. J., KANT, C., AND NAUGHTON, J. F. 1994. A status report on the OO7 OODBMS benchmarking effort. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (Portland), 414-426.
3. CATTELL, R. 1994. The Object Database Standard: ODMG-93 (Release 1.1). Morgan Kaufmann, San Mateo, CA.
4. CHAUDHURI, S. AND SHIM, K. 1993. Query optimization in the presence of foreign functions. In Proceedings of the Nineteenth International Conference on Very Large Data Bases (Dublin), 526-541.
5. CHEN, H., YU, X., YAMAGUCHI, K., KITAGAWA, H., OHBO, N., AND FUJIWARA, Y. 1992. Decomposition - an approach for optimizing queries including ADT functions. Inf. Process. Lett. 43, 6, 327-333.
6. CHIMENTI, D., GAMBOA, R., AND KRISHNAMURTHY, R. 1989. Towards an open architecture for LDL. In Proceedings of the Fifteenth International Conference on Very Large Data Bases (Amsterdam), 195-203.
7. DAYAL, U. 1987. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proceedings of the Thirteenth International Conference on Very Large Data Bases (Brighton), 197-208.
8. DU, W., KRISHNAMURTHY, R., AND SHAN, M.-C. 1992. Query optimization in heterogeneous DBMS. In Proceedings of the Eighteenth International Conference on Very Large Data Bases (Vancouver), 277-291.
9. FALOUTSOS, C. AND KAMEL, I. 1994. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Minneapolis), 4-13.
10. FREW, J. 1995. Personal correspondence.
11. GRAY, J. (Ed.) 1991. The Benchmark Handbook: For Database and Transaction Processing Systems. Morgan-Kaufmann, San Mateo, CA.
12. GRAY, J. 1995. Personal correspondence.
13. HAAS, P. J., NAUGHTON, J. F., SESHADRI, S., AND STOKES, L. 1995. Sampling-based estimation of the number of distinct values of an attribute. In Proceedings of the 21st International Conference on Very Large Data Bases (Zurich).
14. HELLERSTEIN, J. M. 1992. Predicate migration: Optimizing queries with expensive predicates. Tech. Rep. Sequoia 2000 92/13 (Dec.), University of California, Berkeley.
15. HELLERSTEIN, J. M. 1994. Practical predicate placement. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Minneapolis), 325-335.
16. HELLERSTEIN, J. M. AND NAUGHTON, J. F. 1996. Query execution techniques for caching expensive methods. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Montreal), 423-424.
17. HELLERSTEIN, J. M. AND STONEBRAKER, M. 1993. Predicate migration: Optimizing queries with expensive predicates. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Washington, DC), 267-276.
18. HONG, W. AND STONEBRAKER, M. 1993. Optimization of parallel query execution plans in XPRS. Distrib. Parallel Databases Int. J. 1, 1 (Jan.), 9-32.
19. HOU, W.-C., OZSOYOGLU, G., AND TANEJA, B. K. 1988. Statistical estimators for relational algebra expressions. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Austin), 276-287.
20. IBARAKI, T. AND KAMEDA, T. 1984. Optimal nesting for computing N-relational joins. ACM Trans. Database Syst. 9, 3 (Oct.), 482-502.
21. ILLUSTRA 1994. Illustra User's Guide, Illustra Server Release 2.1. Illustra Information Technologies, Inc.
22. IOANNIDIS, Y. AND CHRISTODOULAKIS, S. 1991. On the propagation of errors in the size of join results. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Denver), 268-277.
23. IOANNIDIS, Y. AND POOSALA, V. 1995. Balancing histogram optimality and practicality for query result size estimation. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (San Jose, CA), 233-244.
24. IOANNIDIS, Y. E. AND KANG, Y. C. 1990. Randomized algorithms for optimizing large join queries. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Atlantic City, NJ), 312-321.
25. ISO_ANSI 1993. Database language SQL ISO/IEC 9075:1992.
26. KEMPER, A., MOERKOTTE, G., PEITHNER, K., AND STEINBRUNN, M. 1994. Optimizing disjunctive queries with expensive predicates. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Minneapolis), 336-347.
27. KIM, W. 1993. Object-oriented database systems: Promises, reality, and future. In Proceedings of the Nineteenth International Conference on Very Large Data Bases (Dublin), 676-687.
28. KRISHNAMURTHY, R. AND ZANIOLO, C. 1988. Optimization in a logic based language for knowledge and data intensive applications. In Proceedings of the International Conference on Extending Data Base Technology (Venice), Advances in Database Technology - EDBT '88, J. W. Schmidt, S. Ceri, and M. Missikoff, Eds., Lecture Notes in Computer Science, Volume 303, Springer-Verlag, 128-137.
29. KRISHNAMURTHY, R., BORAL, H., AND ZANIOLO, C. 1986. Optimization of nonrecursive queries. In Proceedings of the Twelfth International Conference on Very Large Data Bases (Kyoto), 128-137.
30. LEVY, A. Y., MUMICK, I. S., AND SAGIV, Y. 1994. Query optimization by predicate movearound. In Proceedings of the 20th International Conference on Very Large Data Bases (Santiago), 96-107.
31. LIPTON, R. J., NAUGHTON, J. F., SCHNEIDER, D. A., AND SESHADRI, S. 1993. Efficient sampling strategies for relational database operations. Theor. Comput. Sci. 116, 195-226.
32. LOHMAN, G. M. 1995. Personal correspondence.
33. LOHMAN, G. M. AND HAAS, L. M. 1993. Personal correspondence.
34. LOHMAN, G. M., DANIELS, D., HAAS, L. M., KISTLER, R., AND SELINGER, P. G. 1984. Optimization of nested queries in a distributed relational database. In Proceedings of the Tenth International Conference on Very Large Data Bases (Singapore), 403-415.
35. LYNCH, C. AND STONEBRAKER, M. 1988. Extended user-defined indexing with application to textual databases. In Proceedings of the Fourteenth International Conference on Very Large Data Bases (Los Angeles), 306-317.
36. MACKERT, L. F. AND LOHMAN, G. M. 1986a. R* optimizer validation and performance evaluation for distributed queries. In Proceedings of the Twelfth International Conference on Very Large Data Bases (Kyoto), 149-159.
37. MACKERT, L. F. AND LOHMAN, G. M. 1986b. R* optimizer validation and performance evaluation for local queries. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Washington, DC), 84-95.
38. MAIER, D. AND STEIN, J. 1986. Indexing in an object-oriented DBMS. In Proceedings of the Workshop on Object-Oriented Database Systems (Asilomar), K. R. Dittrich and U. Dayal, Eds., 171-182.
39. MONMA, C. L. AND SIDNEY, J. 1979. Sequencing with series-parallel precedence constraints. Math. Oper. Res. 4, 215-224.
40. NAUGHTON, J. 1993. Presentation at Fifth International High Performance Transaction Workshop.
41. PALERMO, F. P. 1974. A data base search problem. In Information Systems COINS IV, J. T. Tou, Ed., Plenum Press, New York.
42. PIRAHESH, H. 1994. Object-oriented features of DB2 client/server. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Minneapolis), 483.
43. PIRAHESH, H., HELLERSTEIN, J. M., AND HASAN, W. 1992. Extensible/rule-based query rewrite optimization in Starburst. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (San Diego), 39-48.
44. POOSALA, V. AND IOANNIDIS, Y. 1996. Estimation of query-result distribution and its application in parallel-join load balancing. In Proceedings of the 22nd International Conference on Very Large Data Bases (Bombay), 448-459.
45. POOSALA, V., IOANNIDIS, Y. E., HAAS, P. J., AND SHEKITA, E. J. 1996. Selectivity estimation of range predicates using histograms. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Montreal), 294-305.
46. RAAB, F. 1995. TPC Benchmark D - Standard Specification, Revision 1.0. Transaction Processing Performance Council.
47. SELINGER, P. G., ASTRAHAN, M., CHAMBERLIN, D., LORIE, R., AND PRICE, T. 1979. Access path selection in a relational database management system. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Boston), 22-34.
48. SESHADRI, P., HELLERSTEIN, J. M., PIRAHESH, H., LEUNG, T. C., RAMAKRISHNAN, R., SRIVASTAVA, D., STUCKEY, P. J., AND SUDARSHAN, S. 1996a. Cost-based optimization for Magic: Algebra and implementation. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Montreal), 435-446.
49. SESHADRI, P., PIRAHESH, H., AND LEUNG, T. C. 1996b. Complex query decorrelation. In Proceedings of the Twelfth IEEE International Conference on Data Engineering (New Orleans).
50. SHAPIRO, L. D. 1986. Join processing in database systems with large main memories. ACM Trans. Database Syst. 11, 3 (Sept.), 239-264.
51. SMITH, D. E. 1989. Controlling backward inference. Artif. Intell. 39, 145-208.
52. SMITH, W. E. 1956. Various optimizers for single-stage production. Naval Res. Logist. Q. 3, 59-66.
53. STEINBRUNN, M., PEITHNER, K., MOERKOTTE, G., AND KEMPER, A. 1995. Bypassing joins in disjunctive queries. In Proceedings of the 21st International Conference on Very Large Data Bases (Zurich).
54. STONEBRAKER, M. 1991. Managing persistent objects in a multi-level store. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Denver), 2-11.
55. STONEBRAKER, M. AND KEMNITZ, G. 1991. The POSTGRES next-generation database management system. Commun. ACM 34, 10, 78-92.
56. STONEBRAKER, M., FREW, J., GARDELS, K., AND MEREDITH, J. 1993. The Sequoia 2000 storage benchmark. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Washington, DC), 2-11.
57. SWAMI, A. AND GUPTA, A. 1988. Optimization of large join queries. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Chicago), 8-17.
58. SWAMI, A. AND IYER, B. R. 1992. A polynomial time algorithm for optimizing join queries. Res. Rep. RJ 8812 (June), IBM Almaden Research Center.
59. 3AP - a comparative relational database benchmark. In Proceedings of the IEEE Compcon Spring '89.
60. WONG, E. AND YOUSSEFI, K. 1976. Decomposition - a strategy for query processing. ACM Trans. Database Syst. 1, 3 (Sept.), 223-241.
61. YAJIMA, K., KITAGAWA, H., YAMAGUCHI, K., OHBO, N., AND FUJIWAKA, Y. 1991. Optimization of queries including ADT functions. In Proceedings of the Second International Symposium on Database Systems for Advanced Applications (Tokyo), 366-373.