Skip to main content
SpringerLink
Log in

Scheduling query plans with buffer-requirement estimates

  • Conference paper
  • First Online:
Advances in Databases (BNCOD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 940))

Included in the following conference series:

Abstract

The cost of a database query plan can often be drastically reduced by allocating more buffers to it. But allocating an optimal number of buffers may be infeasible when there is high contention for the buffer space. Previous research has explored the idea that query plans have multiple hot points, which yield local minima of buffer consumption. We describe and analyze query-scheduling strategies that use knowledge of the hot points of each query and actual buffer availability when a query is about to be scheduled.

This research was supported by the National Science Foundation under Grant No. IRI-9211060.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, M. J. Carey, and M. Livny. Models for studying concurrency control performance: Alternatives and implications. In Proceedings of the SIGMOD International Conference on the Management of Data, pages 108–121, Austin, TX, May 1985.

    Google Scholar 

  2. M. J. Carey. Ph.D. Thesis: Modeling and Evaluation of Database Concurrency Control Algorithms. University of California-Berkeley, 1983.

    Google Scholar 

  3. M. J. Carey and M. R. Stonebraker. The performance of concurrency control algorithms for DBMSs. In Proceedings of the 10th International Conference on Very Large Databases, pages 107–118, Singapore, 1984.

    Google Scholar 

  4. C. M. Chen and N. Roussopoulos. Adaptive database buffer allocation using query feedback. In Proceedings of the 19th International Conference on VLDB, pages 342–353, 1993.

    Google Scholar 

  5. J. M. Cheng, C. R. Loosley, A. Shibamiya, and P. S. Worthington. IBM Database 2 performance: Design, implementation, and tuning. IBM Systems Journal, 23(2):189–210, 1984.

    Google Scholar 

  6. H.-T. Chou and D. J. Dewitt. An evaluation of buffer management strategies for relational database. In Proceedings of the International Conference on Very Large Data Bases 1985, pages 127–141, Stockholm, 1985.

    Google Scholar 

  7. E. G. Coffman and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, NJ, 1973.

    Google Scholar 

  8. D. W. Cornell and P. S. Yu. Integration of buffer management and query optimization in relational database environment. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, pages 247–256, Amsterdam, The Netherlands, Aug. 1989.

    Google Scholar 

  9. P. J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323–333, May 1968.

    Google Scholar 

  10. P. J. Denning. Working sets past and present. IEEE Transactions on Software Engineering, SE-6(1):64–84, Jan. 1980.

    Google Scholar 

  11. W. Effelsberg and T. Haerder. Principles of database buffer management. ACM Transactions on Database Systems, 9(4):560–595, Dec. 1984.

    Google Scholar 

  12. C. Faloutsos, R. T. Ng, and T. Sellis. Predictive load control for flexible buffer allocation. In Proceedings of the 17th International Conference on VLDB, pages 265–274, 1991.

    Google Scholar 

  13. L. Kleinrock. Queueing Systems, Volume 2. Wiley, New York, NY, 1976.

    Google Scholar 

  14. M. H. MacDougall. Simulating Computer Systems: Techniques and Tools. The MIT Press, Cambridge, MA, 1987.

    Google Scholar 

  15. M. Mehta and D. J. DeWitt. Dynamic memory allocation for multiple-query work-loads. In Proceedings of the 19th International Conference on VLDB, pages 354–367, 1993.

    Google Scholar 

  16. R Ng, C. Faloutsos, and T. Sellis. Flexible buffer allocation based on marginal gains. In ACM SIGMOD International Conference on the Management of Data, pages 387–396, Denver, CO, 1991.

    Google Scholar 

  17. A. Reuter. Load control and load balancing in a shared database management system. In Proceedings International Conference on Data Engineering, pages 188–199, Los Angeles, Feb. 1986.

    Google Scholar 

  18. D. Ries and M. Stonebraker. Effects of locking granularity on database management system performance. ACM Transactions on Database Systems, 2(3):233–246, Sept. 1977.

    Google Scholar 

  19. D. Ries and M. Stonebraker. Locking granularity revisited. ACM Transactions on Database Systems, 4(2), June 1979.

    Google Scholar 

  20. G. M. Sacco. Fragmentation: A technique for efficient query processing. ACM Transactions on Database Systems, 11(2):113–133, June 1986.

    Google Scholar 

  21. G. M. Sacco and M. Schkolnick. A mechanism for managing the buffer pool in a relational database system using the hot set model. In Proceedings of the 8th Conference on Very Large Databases, pages 257–262, Mexico, 1982.

    Google Scholar 

  22. G. M. Sacco and M. Schkolnick. Buffer management in relational database systems. ACM Transactions on Database Systems, 11(4):473–498, Dec. 1986.

    Google Scholar 

  23. M. R. Stonebraker. Operating systems support for database management systems. Communications of the ACM, 24(7):412–418, July 1981.

    Google Scholar 

  24. M. R. Stonebraker, R. Katz, D. Patterson, and J. Ousterhout. The design of XPRS. In Proceedings of the Fourteenth International Conference on Very Large Data Bases, pages 318–330, Los Angeles, 1988.

    Google Scholar 

  25. P. S. Yu and D. W. Cornell. Optimal buffer allocation in a multi-query environment. In Proceedings of the International Conference on Data Engineering, pages 622–631, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Massachusetts Lowell, 01854, Lowell, MA, USA

    John C. Sieg Jr. & David Pinkney

  2. GTE Government Systems, 02192, Needham, MA, USA

    James Lamoureaux

Authors
  1. John C. Sieg Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Pinkney
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. James Lamoureaux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Carole Goble John Keane

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sieg, J.C., Pinkney, D., Lamoureaux, J. (1995). Scheduling query plans with buffer-requirement estimates. In: Goble, C., Keane, J. (eds) Advances in Databases. BNCOD 1995. Lecture Notes in Computer Science, vol 940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000544

Download citation

  • DOI: https://doi.org/10.1007/BFb0000544

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60100-5

  • Online ISBN: 978-3-540-49427-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation