{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:30:46Z","timestamp":1771461046175,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>Column-oriented database systems have been a real game changer for the industry in recent years. Highly tuned and performant systems have evolved that provide users with the possibility of answering ad hoc queries over large datasets in an interactive manner.<\/jats:p>\n          <jats:p>In this paper we present the column-oriented datastore developed as one of the central components of PowerDrill. It combines the advantages of columnar data layout with other known techniques (such as using composite range partitions) and extensive algorithmic engineering on key data structures. The main goal of the latter being to reduce the main memory footprint and to increase the efficiency in processing typical user queries. In this combination we achieve large speed-ups. These enable a highly interactive Web UI where it is common that a single mouse click leads to processing a trillion values in the underlying dataset.<\/jats:p>","DOI":"10.14778\/2350229.2350259","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1436-1446","source":"Crossref","is-referenced-by-count":61,"title":["Processing a trillion cells per mouse click"],"prefix":"10.14778","volume":"5","author":[{"given":"Alexander","family":"Hall","sequence":"first","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olaf","family":"Bachmann","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"B\u00fcssow","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silviu","family":"G\u0103nceanu","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Nunkesser","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687625"},{"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":"publisher","DOI":"10.1145\/588011.588038"},{"key":"e_1_2_1_6_1","first-page":"1","volume-title":"RANDOM","author":"Bar-Yossef Z.","year":"2002","unstructured":"Z. Bar-Yossef , T. S. Jayram , R. Kumar , D. Sivakumar , and L. Trevisan . Counting distinct elements in a data stream . In RANDOM , pages 1 -- 10 , 2002 . Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, pages 1--10, 2002."},{"key":"e_1_2_1_7_1","first-page":"88","volume-title":"CIDR","author":"Bast H.","year":"2007","unstructured":"H. Bast and I. Weber . The completesearch engine: Interactive, efficient, and towards ir& db integration . In CIDR , pages 88 -- 95 , 2007 . H. Bast and I. Weber. The completesearch engine: Interactive, efficient, and towards ir& db integration. In CIDR, pages 88--95, 2007."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647909.740155"},{"key":"e_1_2_1_9_1","first-page":"225","volume-title":"CIDR","author":"Boncz P. A.","year":"2005","unstructured":"P. A. Boncz , M. Zukowski , and N. Nes . Monetdb\/x100: Hyper-pipelining query execution . In CIDR , pages 225 -- 237 , 2005 . P. A. Boncz, M. Zukowski, and N. Nes. Monetdb\/x100: Hyper-pipelining query execution. In CIDR, pages 225--237, 2005."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/248603.248616"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_16_1","unstructured":"Google Web Toolkit. code.google.com\/webtoolkit.  Google Web Toolkit. code.google.com\/webtoolkit."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559878"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316693"},{"key":"e_1_2_1_19_1","first-page":"439","volume-title":"VLDB","author":"Johnson T.","year":"1994","unstructured":"T. Johnson and D. Shasha . 2q: A low overhead high performance buffer management replacement algorithm . In VLDB , pages 439 -- 450 , 1994 . T. Johnson and D. Shasha. 2q: A low overhead high performance buffer management replacement algorithm. In VLDB, pages 439--450, 1994."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402799"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.02.002"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297303"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1953122.1953148"},{"key":"e_1_2_1_24_1","first-page":"476","volume-title":"VLDB","author":"Moerkotte G.","year":"1998","unstructured":"G. Moerkotte . Small materialized aggregates: A light weight index structure for data warehousing . In VLDB , pages 476 -- 487 , 1998 . G. Moerkotte. Small materialized aggregates: A light weight index structure for data warehousing. In VLDB, pages 476--487, 1998."},{"key":"e_1_2_1_25_1","unstructured":"MonetDB. www.monetdb.org.  MonetDB. www.monetdb.org."},{"key":"e_1_2_1_26_1","unstructured":"Netezza. www.netezza.com.  Netezza. www.netezza.com."},{"key":"e_1_2_1_27_1","unstructured":"Page replacement algorithms. en.wikipedia.org\/wiki\/Page_replacement_algorithm.  Page replacement algorithms. en.wikipedia.org\/wiki\/Page_replacement_algorithm."},{"key":"e_1_2_1_28_1","unstructured":"Partition databases (wiki). en.wikipedia.org\/wiki\/Partition_(database).  Partition databases (wiki). en.wikipedia.org\/wiki\/Partition_(database)."},{"key":"e_1_2_1_29_1","unstructured":"Protocol Buffers: Developer Guide. code.google.com\/apis\/protocolbuffers\/docs\/overview.html.  Protocol Buffers: Developer Guide. code.google.com\/apis\/protocolbuffers\/docs\/overview.html."},{"key":"e_1_2_1_30_1","unstructured":"QlikTech. www.qlikview.com.  QlikTech. www.qlikview.com."},{"key":"e_1_2_1_31_1","volume-title":"Algorithms","author":"Sedgewick R.","year":"2011","unstructured":"R. Sedgewick and K. Wayne . Algorithms . Addison Wesley , 2011 . R. Sedgewick and K. Wayne. Algorithms. Addison Wesley, 2011."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454174"},{"key":"e_1_2_1_33_1","unstructured":"Snappy compression algorithm. code.google.com\/p\/snappy.  Snappy compression algorithm. code.google.com\/p\/snappy."},{"key":"e_1_2_1_34_1","first-page":"553","volume-title":"VLDB","author":"Stonebraker M.","year":"2005","unstructured":"M. Stonebraker , D. J. Abadi , A. Batkin , X. Chen , M. Cherniack , M. Ferreira , E. Lau , A. Lin , S. Madden , E. J. O'Neil , P. E. O'Neil , A. Rasin , N. Tran , and S. B. Zdonik . C-store: A column-oriented dbms . In VLDB , pages 553 -- 564 , 2005 . M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran, and S. B. Zdonik. C-store: A column-oriented dbms. In VLDB, pages 553--564, 2005."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258541"},{"key":"e_1_2_1_36_1","unstructured":"VectorWise. www.actian.com\/products\/vectorwise.  VectorWise. www.actian.com\/products\/vectorwise."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2350229.2350259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:29:02Z","timestamp":1672226942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2350229.2350259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.14778\/2350229.2350259"],"URL":"https:\/\/doi.org\/10.14778\/2350229.2350259","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}