Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Weaving Relations for Cache Performance Anastassia Ailamaki
 

Summary: Weaving Relations for Cache Performance
Anastassia Ailamaki
David J. DeWitt Mark D. Hill Marios Skounakis
Carnegie Mellon University Univ. of Wisconsin-Madison Univ. of Wisconsin-Madison Univ. of Wisconsin-Madison
natassa@cs.cmu.edu dewitt@cs.wisc.edu markhill@cs.wisc.edu marios@cs.wisc.edu
Abstract
Relational database systems have traditionally optimzed 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 increasingly important on modern
platforms. In this paper, we first demonstrate that in-page data
placement is the key to high cache performance and that NSM
exhibits low cache utilization on modern platforms. Next, we pro-
pose a new data organization model called PAX (Partition
Attributes Across), that significantly improves cache perfor-
mance 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, when compared to NSM

  

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