Paper Info
Title
C-Store: A Column-oriented DBMS
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.
Year
Venue
Keywords
2005
VLDB
column-oriented dbms,extensive use,preliminary performance data,current fare,current system,column-oriented projection,careful coding,b-tree structure,bitmap index,main memory,high availability,snapshot isolation,indexation,tree structure
Field
DocType
ISBN
Bitmap index,Snapshot isolation,Data mining,Architecture,Computer science,Sargable,Coding (social sciences),Relational database management system,High availability,Database
Conference
1-59593-154-6
Citations 
PageRank 
References 
547
38.32
17
Authors
14
Search Limit
100547
Name
Order
Citations
PageRank
Michael Stonebraker1124634310.17
Daniel J. Abadi26163367.24
Adam Batkin354738.32
Xuedong Chen455340.16
Mitch Cherniack54128293.66
Miguel Ferreira654738.32
Edmond Lau757241.26
Amerson Lin855239.84
Samuel Madden9161011176.38
Elizabeth J. O'Neil1098773.91
Patrick E. O'Neil111966237.34
Alexander Rasin122950209.48
Nga Tran1365642.46
Stanley B. Zdonik1491861660.15