Skip to main content

Exploitation of the Memory Hierarchy in Relational DBMSs

  • Chapter
  • First Online:
Algorithms for Memory Hierarchies

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

  • 1528 Accesses

Abstract

The exploitation of locality has proven to be paramount for getting the most out of today’s computers. Both data and instruction locality can be exploited from different perspectives, including hardware, base software and software design.

This work was supported by the Ministry of Education and Science of Spain under contracts TIC-0511/98 and TIC2001-0995-C02-01, CEPBA, the CEPBA-IBM Research Institute, and an IBM Research grant.

To my wife Marta and son Ferran who fill my life with joy, and to my caring parents.

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

Access this chapter

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

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.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Larriba-Pey, JL. (2003). Exploitation of the Memory Hierarchy in Relational DBMSs. In: Meyer, U., Sanders, P., Sibeyn, J. (eds) Algorithms for Memory Hierarchies. Lecture Notes in Computer Science, vol 2625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36574-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-36574-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36574-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics