Skip to main content

Prefetch Support Relations in Object Bases

  • Conference paper

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

In this paper we devise and assess a method for optimizing the execution of encapsulated operations (possibly with side-effects) based on the precomputation of the page answer (i.e., the set of referenced pages). For (important) parameter combinations, (1) the page answer, (2) the reference frequency of pages, (3) and the ordering of the page answer according to the first reference of a page during the execution of an operation are stored in a so-called Prefetch Support Relation (PSR). The PSR is used for two purposes: determining “good” candidates for prefetching and for replacement decisions. We devise the algorithms for maintaining the PSR in a consistent state and demonstrate selected benchmark results to assess the viability of the approach.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Ahn. Filtered hashing. In Proc. of the Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), volume 730 of Lecture Notes in Computer Science (LNCS), pages 85–100, Chicago, IL, October 1993. Springer-Verlag.

    Google Scholar 

  2. M. J. Carey, D. J. DeWitt, and J. F. Naughton. The OO7 benchmark. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 12–21, Washington, DC, USA, May 1993.

    Google Scholar 

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

    Google Scholar 

  4. K. M. Curewitz, P. Krishnan, and J. S. Vitter. Practical prefetching via data compression. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 43–53, Washington, DC, USA, May 1993.

    Google Scholar 

  5. M. J. Franklin, M. J. Carey, and M. Livny. Local disk caching for client-server database systems. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 543–554, Dublin, Ireland, August 1993.

    Google Scholar 

  6. C. Gerlhof, A. Kemper, C. Kilger, and G. Moerkotte. Partition-based clustering in object bases: From theory to practice. In Proc. of the Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), volume 730 of Lecture Notes in Computer Science (LNCS), pages 301–316, Chicago, IL, October 1993. Springer-Verlag.

    Google Scholar 

  7. C. A. Gerlhof and A. Kemper. A multi-threaded architecture for prefetching in object bases. In Proc. of the Intl. Conf. Extending Database Technology (EDBT), volume 779 of Lecture Notes in Computer Science (LNCS), pages 351–364, Cambridge, England, March 1994. Springer-Verlag.

    Google Scholar 

  8. C. A. Gerlhof and A. Kemper. Prefetch Support Relations in Object Bases: Design, Implementation and Assessment. Technical report, Universität Passau, 94030 Passau, Germany, 1994. (forthcoming).

    Google Scholar 

  9. N. Kamel and R. King. Intelligent database caching through the use of page-answers and page-traces. ACM Trans. on Database Systems, 17(4):601–646, December 1992.

    Article  MathSciNet  Google Scholar 

  10. K. R. Karlin, S. J. Phillips, and P. Raghavan. Markov paging. In Proc. IEEE Symp. on Foundations of Computer Science, pages 208–217, October 1992.

    Google Scholar 

  11. A. Kemper, C. Kilger, and G. Moerkotte. Function materialization in object bases. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 258–268, Denver, USA, May 1991.

    Google Scholar 

  12. A. Kemper, C. Kilger, and G. Moerkotte. Function Materialization in Object Bases: Design, Implementation and Assessment. IEEE Trans. Knowledge and Data Engineering, 6(4), August 1994.

    Google Scholar 

  13. A. Kemper and G. Moerkotte. Object-Oriented Database Management: Applications in Engineering and Computer Science. Prentice Hall, Englewood Cliffs, NJ, USA, 1994.

    Google Scholar 

  14. E. J. O’Neil, P. E. O’Neil, and G. Weikum. The LRU-K page replacement algorithm for database disk buffering. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 297–306, Washington, DC, USA, May 1993.

    Google Scholar 

  15. M. L. Palmer and S. B. Zdonik. FIDO: A cache that learns to fetch. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 255–264, Barcelona, September 1991.

    Google Scholar 

  16. J. T. Robinson and M. V. Devarakonda. Data cache management using frequency-based replacement. In Proc. of the ACM SIGMETRICS, pages 134–142, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Gerlhof, C.A., Kemper, A. (1995). Prefetch Support Relations in Object Bases. In: Atkinson, M., Maier, D., Benzaken, V. (eds) Persistent Object Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-2122-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2122-0_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19912-0

  • Online ISBN: 978-1-4471-2122-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics