Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Database management systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Architecture-conscious database systems
Architecture-conscious database systems
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Super-Scalar RAM-CPU Cache Compression
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Integrating compression and execution in column-oriented database systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Performance tradeoffs in read-optimized databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
How to wring a table dry: entropy compression of relations and querying of compressed relations
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Data morphing: an adaptive, cache-conscious storage technique
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
NetStore: an efficient storage infrastructure for network forensics and monitoring
RAID'10 Proceedings of the 13th international conference on Recent advances in intrusion detection
The performance of MapReduce: an in-depth study
Proceedings of the VLDB Endowment
Database compression on graphics processors
Proceedings of the VLDB Endowment
Reordering columns for smaller indexes
Information Sciences: an International Journal
ECOS: evolutionary column-oriented storage
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Optimizing write performance for read optimized databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Easing the burdens of HPC file management
Proceedings of the sixth workshop on Parallel Data Storage
MCJoin: a memory-constrained join for column-store main-memory databases
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Real-time creation of bitmap indexes on streaming network data
The VLDB Journal — The International Journal on Very Large Data Bases
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Design and evaluation of storage organizations for read-optimized main memory databases
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Recently, a number of papers have been published showing the benefits of column stores over row stores. However, the research comparing the two in an "apples-to-apples" way has left a number of unresolved questions. In this paper, we first discuss the factors that can affect the relative performance of each paradigm. Then, we choose points within each of the factors to study further. Our study examines five tables with various characteristics and different query workloads in order to obtain a greater understanding and quantification of the relative performance of column stores and row stores. We then add materialized views to the analysis and see how much they can help the performance of row stores. Finally, we examine the performance of hash join operations in column stores and row stores.