skip to main content
10.1145/130283.130294acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

Extensible/rule based query rewrite optimization in Starburst

Published:01 June 1992Publication History

ABSTRACT

This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starburst to transform queries into equivalent queries for faster execution, and also describe the production rule engine which is used by Starburst to choose and execute these rules. Examples are provided demonstrating that these Query Rewrite transformations lead to query execution time improvements of orders of magnitude, suggesting that Query Rewrite in general—and these rewrite rules in particular—are an essential step in query optimization for modern database systems.

References

  1. ABC+76.M. Astrahan, M. Blasgen, D. Chamberlin, K. Eswaran, J. Gray, P. Griffiths, W. King, R. Lorie, P. McJones, J. Mehl, G. Putzolu, I. Traiger, B. Wade, and V. Watson. System R: Relational Approach to Database Management. ACM Transactions on Database Systems, 1(2):97-137, June 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anf89.Ole Jirgen Anfindsen.A Study of Access Path Selection in DB2. Technical report, Norwegian Telecommunications Administration and University of Oslo, Norway, October 1989.Google ScholarGoogle Scholar
  3. BFKM85.L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley Publishing Co., 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BTA90.Jose Blakeley, Craig Thompson, and Abdallah Alashqur. Strawman reference model for object query language. In First OODB Standardization Workshop, X3/SPARC/DBSSG/OODBTG, Atlantic City, New Jersey, May 1990.Google ScholarGoogle Scholar
  5. Day87.Umeshwar Dayal. Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers. In Proc. 13th International Conference on Very Large Data Bases, pages 197-208, Brighton, September 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. GW87.Richard A. Ganski and Harry K. T. Wong. Optimization of Nested SQL Queries Revisited. In Proc. ACM- SIGMOD International Conference on Management of Data, pages 23-33, San Francisco, May 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. HCL+90.L.M. Haas, W. Chang, G.M. Lohman, J. McPherson, P.F. Wilms, G. Lapis, B. Lindsay, H. Pirahesh, M. Carey, and E. Shekita. Starburst Mid-Flight: As the Dust Clears. 1EEE Transactions on Knowledge and Data Engineering, pages 143-160, March 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. HH91.Joseph M. Hellerstein and Meichun Hsu. Determinism in Partially Ordered Production Systems. Research Report RJ 8089, IBM Almaden Research Center, March 1991.Google ScholarGoogle Scholar
  9. HP88.Waqar Hasan and Hamid Pirahesh. Query Rewrite Optimization in Starburst. Research Report RJ 6367, IBM Almaden Research Center, August 1988.Google ScholarGoogle Scholar
  10. HSS88.T. Haerder, H. Schoning, and A. Sikeler. Parallelism in Processing Queries on Complex Object. In Proc. International Symposium on Databases in Parallel and Distributed Systems, Austin, December 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. ISO91.ISO_ANSI. Database Language SQL ISOBEC 9075:1992, 1991.Google ScholarGoogle Scholar
  12. Kim82.W. Kim. On Optimizing an SQL-like Nested Query. ACM Transactions on Database Systems, 7(3), September 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. LLOW91.Chares Lamb, Gordon Landis, JackOrenstein, and Dan Weinreb. The Objectstore Database System. Communications of the ACM. October 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. LLPS91.Guy Lohman, Bruce Lindsay, Hamid Pirahesh, and Bemhard Schiefer. Extensions to Starburst: Objects, Types, Functions, and Rules. Communications of the ACM, October 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Loo86.Chris Loosley. Measuring IBM Database 2 Release 2 - The Benchmark Game. InfoDB, 1(2), 1986.Google ScholarGoogle Scholar
  16. MF78.J. McDermott and C. Forgy. Production System Conflict Resolution Strategies. In D.A. Waterman and Fredrick Hayes-Roth, editors, Pattern Directed Inference Systems, pages 177-199. Academic Press, 1978.Google ScholarGoogle ScholarCross RefCross Ref
  17. MFPR90a.Inderpal Singh Mumick, SheldonJ. Finkelstein, Hamid Pirahesh, and Raghu Ramakrishnan. Magic is Relevant. In Proc. SIGMOD 90 {Pro90}, pages 247-258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. MFPR90b.Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, and Raghu Ramakrishnan. Magic Conditions. In Proc. 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 314-330, Nashville, March 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. MPR90.Inderpal Singh Mumick, Hamid Pirahesh, and Raghu Ramakrishnan. The Magic of Duplicates and Aggregates. In Proc. 16th International Conference on Very Large Data Bases, Brisbane, August 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. O'N89.P. O'Neil. Revisiting DBMS Benchmarks. Datamation, pages 47-54, September 15, 1989.Google ScholarGoogle Scholar
  21. Pir89.Hamid Pirahesh. Early Experience with Rule-Based Query Rewrite Optimization. In G. Graefe, editor, Workshop on Database Query Optimization, CSE Technical Report 89-005. Oregon Graduate Center, May 1989.Google ScholarGoogle Scholar
  22. Pro90.Proc. ACM-SIGMOD International Conference on Management of Data, Atlantic City, May 1990.Google ScholarGoogle Scholar
  23. Ras90.Louiqa Raschid. Maintaining Consistency in a Stratified Production System Program. In Proc. AAAI National Conference on Artificial Intelligence, 1990.Google ScholarGoogle Scholar
  24. RGL90.Arnon Rosenthal and Cesar Galindo-Legaria. Query graphs, implementing trees, and freely-reorderable outerjoins. In Proc. SIGMOD 90 {Pro90}. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. SAC+79.Patricia G. Selinger, M. Astrahan, D. Chamberlin, Raymond Lorie, and T. Price. Access Path Selection in a Relational Database Management System. In Proc. ACM-SIGMOD International Conference on Management of Data, Boston, June 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. SJGP90.M. Stonebraker, A. Jhingran, Jeffrey Goh, and Spyros Potamianos. On rules, procedures, caching and views in data base systems, in Proc. SIGMOD 90 {Pro90}. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. SWK76.M.R. Stonebraker, E. Wong, and P. Kreps. The design and implementation of ingres. ACM Transactions on Database Systems, 1 (3):189-222, September 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. TOB89.C. Turbyfill, C. Orji, and Dina Bitton. AS3AP - A Comparative Relational Database Benchmark. In Proc. IEEE Compcon Spring '89, February 1989.Google ScholarGoogle Scholar
  29. ZH90.Yuli Zhou and Meichun Hsu. A Theory for Rule Triggering Systems. In Francois Bancilhon, Costantino Thanos, and Dennis Tsichritzis, editors, Proc. International Conference on Extending Data Base Technology, Advances in Database Technology - EDBT '90. Lecture Notes in Computer Science, Volume 416, Venice, March 1990. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Extensible/rule based query rewrite optimization in Starburst

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                SIGMOD '92: Proceedings of the 1992 ACM SIGMOD international conference on Management of data
                June 1992
                416 pages
                ISBN:0897915216
                DOI:10.1145/130283

                Copyright © 1992 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 June 1992

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                Overall Acceptance Rate785of4,003submissions,20%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader