Skip to main content
SpringerLink
Log in

Common Subexpression Isolation in Multiple Query Optimization

  • Chapter
Query Processing in Database Systems

Part of the book series: Topics in Information Systems ((TINF))

Abstract

The simultaneous optimization of multiple queries submitted to a database system may lead to substantial savings over the current approach of optimizing each query separately. Isolating common subexpressions in multiple queries and treating their execution as a sharable resource are important prerequisites. This chapter presents techniques for recognizing, supporting, and exploiting common subexpressions in record-oriented, relational algebra, domain relational calculus, and tuple relational calculus query representations. It also investigates preconditions that transaction management mechanisms must satisfy to make multiple query optimization effective.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arditi J, “An optimized backout mechanism for sequential updates”, Proc. 5th VLDB Conference, Rio de Janeiro, 1979, 147–154

    Google Scholar 

  2. Barber RE, Lucas HC, “System response time, operator productivity, and job satisfaction”, Communications of the ACM, 26,11, November 1983, 972–986

    Article  Google Scholar 

  3. Bernstein PA, Goodman N, “Multiversion concurrency control-theory and algorithms”, ACM Transactions on Database Systems, 8,4, December 1983, 465–483

    Google Scholar 

  4. Braegger RP, Reimer M, “Predicative scheduling: integration of locking and optimistic methods”, Bericht 53, ETH Zuerich, 1983

    Google Scholar 

  5. Chakravarthy US, Minker J, “Processing multiple queries in database systems”. IEEE Database Engineering, 5,3, September 1982, 38–43

    Google Scholar 

  6. Chesnais A, Gelenbe E, Mitrani I, “On the modelling of parallel access to shared data”, Communications of the ACM 26,3,1983, 196–202

    Google Scholar 

  7. Eswaran KP, Gray JN, Lorie RA, Traiger IL, “The notions of consistency and predicate locks in a database system”, Communications of the ACM, 19,11, 1976, 624–633

    Article  MATH  MathSciNet  Google Scholar 

  8. Finkelstein S, “Common expression analysis in database applications”, Proc. ACM-SIGMOD Conference, Orlando, 1982, 235–345

    Google Scholar 

  9. Grant J, Minker J, “Optimization in deductive and conventional relational database systems”, Gallaire H, Minker J, Nicholas JM (eds), Advances in Database Theory, Plenum, New York, 1981, 195–234

    Google Scholar 

  10. Gray JN, Lorie RA, Putzolu GR, “Granularity of locks in a shared database”, Proc. 1st VLDB Conference, Framingham, MA, 1975, 428–451

    Google Scholar 

  11. Hall PAV, “Optimization of a single relational expression in a relational database”, IBM Journal of Research and Development, 20, 1976, 244–257

    Article  MATH  Google Scholar 

  12. Henschen L, Naqvi S, “On compiling queries in recursive first-order databases”, Journal of the ACM 31, 1984,47–85.

    Article  MATH  MathSciNet  Google Scholar 

  13. Hevner AR, Yao SB, “Transaction optimization on a distributed database system”, Technical Report HR-81–259, Honeywell Corporate Computer Science Center, Bloomington, MN, 1981

    Google Scholar 

  14. Jarke M, Schmidt JW, “Query processing strategies in the PASCAL/R relational database management system”, Proc. ACM SIGMOD Conference, Orlando, 1982, 256–264

    Google Scholar 

  15. Jarke M, Koch J, “Range nesting: a fast method to evaluate quantified queries”, Proc. ACM SIGMOD Conference, San Jose, 1983, 196–206

    Google Scholar 

  16. Jarke M, Clifford J, Vassiliou Y, “An optimizing PROLOG front-end to a relational query system”, Proc. ACM SIGMOD Conference, Boston, 1984

    Google Scholar 

  17. Jarke M, Koch J, Schmidt JW, “Introduction to query processing”, this volume.

    Google Scholar 

  18. Kedem ZM, Silberschatz A, “Locking protocols: from exclusive to shared locks, Journal of the ACM, 30, 4,1983, 787–804

    Article  MATH  Google Scholar 

  19. Kim W, “Query optimization for relational database Systems”, IBM Technical Report RJ3081, San Jose, 1981

    Google Scholar 

  20. Kowalski R, Logic as a Database Language, Imperial College, London, 1981

    Google Scholar 

  21. Mall M, Reimer M, Schmidt JW, “Data selection, sharing and access control in a relational scenario”, in [BROD84]

    Google Scholar 

  22. March ST, “Physical database design: techniques for improved database performance”, this volume

    Google Scholar 

  23. Marque-Pucheu G, Martin-Gallausiaux J, Jomier G, “Interfacing Prolog and relational data base management systems”, Gardarin G, Gelenbe E (Eds), New Applications of Data Bases, Academic Press, 1984

    Google Scholar 

  24. Minker J, Nicolas JM, “On recursive axioms in deductive databases”, Information Systems, 8,1983, 1–13

    Article  MATH  Google Scholar 

  25. Münz R, Schneider HJ, Steyer F, “Application of sub-predicate tests in database systems”, Proc. 5th VLDB Conference, Rio de Janeiro, 1979, 426–435.

    Google Scholar 

  26. Nievergelt J, Hinterberger H, Sevcik KC, “The grid file: an adaptable, symmetric multi-key file structure”, ACM Transactions on Database Systems, 9,1, March 1984, 38–71

    Google Scholar 

  27. Reimer M, “Solving the phantom problem by predicative optimistic concurrency control”, Proc. 9th VLDB Conference, Florence, 1983, 81–88.

    Google Scholar 

  28. Ries DR, Stonebraker M, “Effects of locking granularity in a database management system”, ACM Transations on Database Systems, 2,3, 1977, 233–246

    Google Scholar 

  29. Rosenkrantz DJ, Hunt MB, “Processing conjunctive predicates and queries”, Proc. 6th VLDB Conference, Montreal, 1980, 64–74

    Google Scholar 

  30. Roussopoulos N, “View indexing in relational databases”, ACM Transactions on Database Systems, 7,1982, 258–290

    Article  MATH  Google Scholar 

  31. Roussopoulos N, “The logical access path schema of a database”, IEEE Transactions on Software Engineering SE-8, 6,1982, 563–573

    Article  MathSciNet  Google Scholar 

  32. Sagiv Y, Yannakakis M, “Equivalences among relational expressions with the union and difference operators”, Journal of the ACM, 21,4, 1980, 633–655

    Google Scholar 

  33. Schmidt JW, Mall M, “Pascal/R Report”, Report 66, Fachbereich Informatik, University of Hamburg, 1980

    Google Scholar 

  34. Schmidt, JW, Mall M, “Abstraction mechanisms for database programming,” Proc. ACM SIGPLAN Symposium on Programming Languages in Software Systems, SIGPLAN Notices, 18,6, San Francisco, 1983

    Google Scholar 

  35. Shneiderman B, Goodman V, “Batched searching of sequential and tree structured files”, ACM Transactions on Database Systems, 1,3, September, 268–275

    Google Scholar 

  36. Smith JM, Chang PYT, “Optimizing the performance of a relational algebra database interface”, Communications of the ACM, 18,10, October 1975, 568–579

    Google Scholar 

  37. Wong E, Youssefi K, “Decomposition-a strategy for query processing”, ACM Transactions on Database Systems, 1, 3, September 1976, 223–241

    Article  Google Scholar 

Download references

Authors
  1. Matthias Jarke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronics & Computer Technology Corporation, 9430 Research Boulevard, 78759, Austin, TX, USA

    Won Kim

  2. Computer Corporation of America, Four Cambridge Center, 02142, Cambridge, MA, USA

    David S. Reiner

  3. Department of Computer Science, The University of Texas at Austin, 78712, Austin, TX, USA

    Don S. Batory

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jarke, M. (1985). Common Subexpression Isolation in Multiple Query Optimization. In: Kim, W., Reiner, D.S., Batory, D.S. (eds) Query Processing in Database Systems. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82375-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82375-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82377-0

  • Online ISBN: 978-3-642-82375-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation