C-Store: A column-oriented DBMS

907Citations
Citations of this article
694Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Stonebraker, M., Abadi, D. J., Batkin, A., Chen, X., Cherniack, M., Ferreira, M., … Zdonik, S. (2005). C-Store: A column-oriented DBMS. In VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases (Vol. 2, pp. 553–564). https://doi.org/10.1145/3226595.3226638

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free