About This Item

Ask the MINDS@UW Librarian

A Comparison of C-Store and Row-Store in a Common Framework

Show full item record

File(s):

Author(s)
Halverson, Alan; Beckmann, Jennifer L.; Naughton, Jeffrey F.; Dewitt, David J.
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Date
Mar 15, 2012
Abstract
Recently, a ìcolumn storeî system called CStore has shown significant performance benefits by utilizing storage optimizations for a read-mostly query workload. The authors of the C-Store paper compared their optimized column store to a commercial row store RDBMS that is optimized for a mixture of reads and writes, which obscures the relative benefits of row and column stores. In this paper, we describe two storage optimizations for a row store architecture given a read-mostly query workload ñ ìsuper tuplesî and ìcolumn abstraction.î We implement both our optimized row store and C-Store in a common framework in order to perform an ìapples-to-applesî comparison of the optimizations in isolation and combination. We also develop a detailed cost model for sequential scans tobreak down time spent into three categories ñ disk I/O, iteration cost, and local tuple reconstruction cost. We conclude that, while the C-Store system offers tremendous performance benefits for scanning a small fraction of columns from a table, our optimized row store provides disk storage savings, reduced sequential scan times, and low additional CPU overheads while requiring only evolutionary changes to a standard row store.
Permanent link
http://digital.library.wisc.edu/1793/60514 
Export
Export to RefWorks 
‚Äč

Part of

Show full item record

Search and browse




About MINDS@UW

Deposit materials

  1. Register to deposit in MINDS@UW
  2. Need deposit privileges? Contact us.
  3. Already registered? Have deposit privileges? Deposit materials.