Column-oriented query processing for row stores

Authors:
Amr El-Helw;Kenneth A. Ross;Bishwaranjan Bhattacharjee;Christian A. Lang;George A. Mihaila
Affiliations:
University of Waterloo, Waterloo, ON, Canada;Columbia University, New York, NY, USA;IBM Watson Research Center, Hawthorne, NY, USA;Acelot, Inc., Santa Barbara, CA, USA;Google, Inc., New York, NY, USA
Venue:
Proceedings of the ACM 14th international workshop on Data Warehousing and OLAP
Year:
2011

Citing 18
Cited 1

Single table access using multiple indexes: optimization, execution, and concurrency control techniques

EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Block Oriented Processing of Relational Database Operations in Modern Computer Architectures

Proceedings of the 17th International Conference on Data Engineering
MIL primitives for querying a fragmented world

The VLDB Journal — The International Journal on Very Large Data Bases
Multi-dimensional clustering: a new data layout scheme in DB2

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Buffering databse operations for enhanced instruction cache performance

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
C-store: a column-oriented DBMS

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Integrating compression and execution in column-oriented database systems

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
FlashDB: dynamic self-tuning database for NAND flash

Proceedings of the 6th international conference on Information processing in sensor networks
Lazy, adaptive rid-list intersection, and its application to index anding

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient columnar storage in B-trees

ACM SIGMOD Record
A case for fractured mirrors

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Column-stores vs. row-stores: how different are they really?

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Query processing techniques for solid state drives

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
FlashLogging: exploiting flash devices for synchronous logging performance

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Column-oriented database systems

Proceedings of the VLDB Endowment
Page-differential logging: an efficient and DBMS-independent approach for storing data into flash memory

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
FlashStore: high throughput persistent key-value store

Proceedings of the VLDB Endowment
SQL server column store indexes

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

DOLAP 2011: overview of the 14th international workshop on data warehousing and olap

Proceedings of the 20th ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Column-oriented DBMSs have gained increasing interest due to their superior performance for analytical workloads. Prior efforts tried to determine the possibility of simulating the query processing techniques of column-oriented systems in row-oriented databases, in a hope to improve their performance, especially for OLAP and data warehousing applications. In this paper, we show that column-oriented query processing can significantly improve the performance of row-oriented DBMSs. We introduce new operators that take into account the unique characteristics of data obtained from indexes, and exploit new technologies such as flash SSDs and multi-core processors to boost the performance. We demonstrate our approach with an experimental study using a prototype built on a commercial row-oriented DBMS.