{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:10:07Z","timestamp":1758280207947},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/1453856.1453912","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"502-513","source":"Crossref","is-referenced-by-count":26,"title":["Read-optimized databases, in depth"],"prefix":"10.14778","volume":"1","author":[{"given":"Allison L.","family":"Holloway","sequence":"first","affiliation":[{"name":"University of Wisconsin - Madison"}]},{"given":"David J.","family":"DeWitt","sequence":"additional","affiliation":[{"name":"University of Wisconsin - Madison"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"https:\/\/www.cs.hut.fi\/Opinnot\/T-106.290\/K2005\/Ohjeet\/Zipf.html. Accessed November 8 2007.  https:\/\/www.cs.hut.fi\/Opinnot\/T-106.290\/K2005\/Ohjeet\/Zipf.html. Accessed November 8 2007."},{"key":"e_1_2_1_2_1","unstructured":"http:\/\/db.lcs.mit.edu\/projects\/cstore\/. Accessed November 8 2007.  http:\/\/db.lcs.mit.edu\/projects\/cstore\/. Accessed November 8 2007."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376712"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Abadi D. J. Myers D. S. DeWitt D. J. Madden S. R. \"Materialization Strategies in a Column-Oriented DBMS.\" In ICDE 2007.  Abadi D. J. Myers D. S. DeWitt D. J. Madden S. R. \"Materialization Strategies in a Column-Oriented DBMS.\" In ICDE 2007.","DOI":"10.1109\/ICDE.2007.367892"},{"key":"e_1_2_1_7_1","volume-title":"Weaving Relations for Cache Performance.\" In VLDB","author":"Ailamaki A.","year":"2001","unstructured":"Ailamaki , A. , DeWitt , D. J. , Hill , M. D. , and Skounakis , M . \" Weaving Relations for Cache Performance.\" In VLDB , 2001 . Ailamaki, A., DeWitt, D. J., Hill, M. D., and Skounakis, M. \"Weaving Relations for Cache Performance.\" In VLDB, 2001."},{"key":"e_1_2_1_8_1","volume-title":"MonetDB\/X100: Hyper-Pipelining Query Execution.\" In CIDR","author":"Boncz P.","year":"2005","unstructured":"Boncz , P. , Zukowski , M. , and Nes , N . \" MonetDB\/X100: Hyper-Pipelining Query Execution.\" In CIDR , 2005 . Boncz, P., Zukowski, M., and Nes, N. \"MonetDB\/X100: Hyper-Pipelining Query Execution.\" In CIDR, 2005."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/318898.318923"},{"key":"e_1_2_1_10_1","first-page":"T1666","article-title":"A Comparison of C-Store and Row-Store in a Common Framework","author":"Halverson A. J.","year":"2006","unstructured":"Halverson , A. J. , Beckmann , J. L. , Naughton , J. F. , DeWitt , D. J. \" A Comparison of C-Store and Row-Store in a Common Framework .\" Technical Report, University of Wisconsin-Madison, Department of Computer Sciences , T1666 , 2006 . Halverson, A. J., Beckmann, J. L., Naughton, J. F., DeWitt, D. J. \"A Comparison of C-Store and Row-Store in a Common Framework.\" Technical Report, University of Wisconsin-Madison, Department of Computer Sciences, T1666, 2006.","journal-title":"Technical Report, University of Wisconsin-Madison, Department of Computer Sciences"},{"key":"e_1_2_1_11_1","volume-title":"Cache-Conscious Storage Technique.\" In VLDB","author":"Hankins R. A.","year":"2003","unstructured":"Hankins , R. A. , Patel , J. M. \" Data Morphing : An Adaptive , Cache-Conscious Storage Technique.\" In VLDB , 2003 . Hankins, R. A., Patel, J. M. \"Data Morphing: An Adaptive, Cache-Conscious Storage Technique.\" In VLDB, 2003."},{"key":"e_1_2_1_12_1","volume-title":"Performance Tradeoffs in Read-Optimized Databases.\" In VLDB","author":"Harizopoulos S.","year":"2006","unstructured":"Harizopoulos , S. , Liang , V. , Abadi , D. , and Madden , S . \" Performance Tradeoffs in Read-Optimized Databases.\" In VLDB , 2006 . Harizopoulos, S., Liang, V., Abadi, D., and Madden, S. \"Performance Tradeoffs in Read-Optimized Databases.\" In VLDB, 2006."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247525"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Huffman D. \"A Method for the Construction of Minimum-Redundancy Codes.\" In Proceedings of the I. R. E. pages 1098--1102 1952.  Huffman D. \"A Method for the Construction of Minimum-Redundancy Codes.\" In Proceedings of the I. R. E. pages 1098--1102 1952.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_1_15_1","volume-title":"Database Management Systems","author":"Ramakrishnan R.","year":"2003","unstructured":"Ramakrishnan , R. and Gehrke , J . Database Management Systems . McGraw-Hill , 3 rd edition, 2003 . Ramakrishnan, R. and Gehrke, J. Database Management Systems. McGraw-Hill, 3rd edition, 2003.","edition":"3"},{"key":"e_1_2_1_16_1","unstructured":"Raman V. Swart G. \"Entropy Compression of Relations and Querying of Compressed Relations.\" In VLDB 2006.   Raman V. Swart G. \"Entropy Compression of Relations and Querying of Compressed Relations.\" In VLDB 2006."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/6314.6315"},{"key":"e_1_2_1_18_1","volume-title":"A Column-Oriented DBMS.\" In VLDB","author":"Stonebraker M.","year":"2005","unstructured":"Stonebraker , M. , Store : A Column-Oriented DBMS.\" In VLDB , 2005 . Stonebraker, M., et al. \"C-Store: A Column-Oriented DBMS.\" In VLDB, 2005."},{"key":"e_1_2_1_19_1","unstructured":"T. P. P. Council. \"TPC Benchmark H (Decision Support) \" http:\/\/www.tpc.org\/tpch\/default.asp August 2003.  T. P. P. Council. \"TPC Benchmark H (Decision Support) \" http:\/\/www.tpc.org\/tpch\/default.asp August 2003."},{"key":"e_1_2_1_20_1","unstructured":"\"The Vertica Database Technical Overview White Paper.\" Vertica 2007.  \"The Vertica Database Technical Overview White Paper.\" Vertica 2007."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1453856.1453912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:04:55Z","timestamp":1672225495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453912"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453912","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}