Data Layout in Main Memory

Hasso Plattner
Additional contact information
Hasso Plattner: Hasso Plattner Institute

Chapter Chapter 8 in A Course in In-Memory Data Management, 2014, pp 57-63 from Springer

Abstract: Abstract In this chapter, we address the question how data is organized in memory. Relational database tables have a two-dimensional structure but main memory is organized unidimensional, providing memory addresses that start at zero and increase serially to the highest available location. The database storage layer has to decide how to map the two-dimensional table structures to the linear memory address space.

Keywords: Main Memory; Cache Line; Access Cost; Data Layout; Translation Lookaside Buffer (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-55270-0_8

Ordering information: This item can be ordered from
http://www.springer.com/9783642552700

DOI: 10.1007/978-3-642-55270-0_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().