C-store: a column-oriented DBMS

  • Authors:

  • Mike Stonebraker;Daniel J. Abadi;Adam Batkin;Xuedong Chen;Mitch Cherniack;Miguel Ferreira;Edmond Lau;Amerson Lin;Sam Madden;Elizabeth O'Neil;Pat O'Neil;Alex Rasin;Nga Tran;Stan Zdonik

  • Affiliations:

  • MIT CSAIL, Cambridge, MA;MIT CSAIL, Cambridge, MA;Brandeis University, Waltham, MA;UMass Boston, Boston, MA;Brandeis University, Waltham, MA;MIT CSAIL, Cambridge, MA;MIT CSAIL, Cambridge, MA;MIT CSAIL, Cambridge, MA;MIT CSAIL, Cambridge, MA;UMass Boston, Boston, MA;UMass Boston, Boston, MA;Brown University, Providence, RI;Brandeis University, Waltham, MA;Brown University, Providence, RI

  • Venue:
  • VLDB '05 Proceedings of the 31st international conference on Very large data bases
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its design are: storage of data by column rather than by row, careful coding and packing of objects into storage including main memory during query processing, storing an overlapping collection of column-oriented projections, rather than the current fare of tables and indexes, a non-traditional implementation of transactions which includes high availability and snapshot isolation for read-only transactions, and the extensive use of bitmap indexes to complement B-tree structures.We present preliminary performance data on a subset of TPC-H and show that the system we are building, C-Store, is substantially faster than popular commercial products. Hence, the architecture looks very encouraging.