Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Data Page Layouts for Relational Databases on Deep Memory Hierarchies
 

Summary: Data Page Layouts for Relational Databases
on Deep Memory Hierarchies
Anastassia Ailamaki David J. DeWitt Mark D. Hill
Abstract
Relational database systems have traditionally optimized for I/O performance and organized
records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages).
Recent research, however, indicates that cache utilization and performance is becoming increas-
ingly important on modern platforms. In this paper, we first demonstrate that in-page data place-
ment is the key to high cache performance and that NSM exhibits low cache utilization on modern
platforms. Next, we propose a new data organization model called PAX (Partition Attributes
Across), that significantly improves cache performance by grouping together all values of each
attribute within each page. Because PAX only affects layout inside the pages, it incurs no storage
penalty and does not affect I/O behavior. According to our experimental results (which were
obtained without using any indices on the participating relations), when compared to NSM (a)
PAX exhibits superior cache and memory bandwidth utilization, saving at least 75% of NSM's stall
time due to data cache accesses, (b) range selection queries and updates on memory-resident rela-
tions execute 17-25% faster, and (c) TPC-H queries involving I/O execute 11-48% faster. Finally,
we show that PAX performs well across different memory system designs.
1 Introduction
Although the major performance bottleneck in database systems has traditionally been I/O, modern

  

Source: Ailamaki, Anastassia - School of Computer Science, Carnegie Mellon University
Hill, Mark D. - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences