{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:02:47Z","timestamp":1775638967594,"version":"3.50.1"},"reference-count":13,"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>Table scans have become more interesting recently due to greater use of ad-hoc queries and greater availability of multi-core, vector-enabled hardware. Table scan performance is limited by value representation, table layout, and processing techniques. In this paper we propose a new layout and processing technique for efficient one-pass predicate evaluation. Starting with a set of rows with a fixed number of bits per column, we append columns to form a set of banks and then pad each bank to a supported machine word length, typically 16, 32, or 64 bits. We then evaluate partial predicates on the columns of each bank, using a novel evaluation strategy that evaluates column level equality, range tests, IN-list predicates, and conjuncts of these predicates, simultaneously on multiple columns within a bank, and on multiple rows within a machine register. This approach outperforms pure column stores, which must evaluate the partial predicates one column at a time. We evaluate and compare the performance and representation overhead of this new approach and several proposed alternatives.<\/jats:p>","DOI":"10.14778\/1453856.1453925","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"622-634","source":"Crossref","is-referenced-by-count":51,"title":["Row-wise parallel predicate evaluation"],"prefix":"10.14778","volume":"1","author":[{"given":"Ryan","family":"Johnson","sequence":"first","affiliation":[{"name":"C.M.U."}]},{"given":"Vijayshankar","family":"Raman","sequence":"additional","affiliation":[{"name":"IBM Almaden Res. Ctr."}]},{"given":"Richard","family":"Sidle","sequence":"additional","affiliation":[{"name":"IBM Almaden Res. Ctr."}]},{"given":"Garret","family":"Swart","sequence":"additional","affiliation":[{"name":"Oracle"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0074-9"},{"key":"e_1_2_1_3_1","volume-title":"CIDR","author":"Boncz P.","year":"2005","unstructured":"P. Boncz , M. Zukowski , and N. Nes . MonetDB\/X100: Hyper-Pipelining Query Execution . In CIDR , 2005 . P. Boncz, M. Zukowski, and N. Nes. MonetDB\/X100: Hyper-Pipelining Query Execution. In CIDR, 2005."},{"key":"e_1_2_1_4_1","volume-title":"VLDB","author":"Boncz P. A.","year":"1999","unstructured":"P. A. Boncz Database Architecture Optimized for the New Bottleneck: Memory Access . In VLDB , 1999 . P. A. Boncz et al. Database Architecture Optimized for the New Bottleneck: Memory Access. In VLDB, 1999."},{"key":"e_1_2_1_5_1","volume-title":"ESCAPE","author":"Dosa G.","year":"2007","unstructured":"G. Dosa . The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)=(11\/9)OPT(I)+6\/9 . In ESCAPE , 2007 . G. Dosa. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)=(11\/9)OPT(I)+6\/9. In ESCAPE, 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316798"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656552"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315531"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497414"},{"key":"e_1_2_1_10_1","volume-title":"VLDB","author":"Raman V.","year":"2006","unstructured":"V. Raman and G. Swart . Entropy compression of relations and querying of compressed relations . In VLDB , 2006 . V. Raman and G. Swart. Entropy compression of relations and querying of compressed relations. In VLDB, 2006."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564709"},{"key":"e_1_2_1_12_1","volume-title":"IBM DB2 9 New Features","author":"Zikopoulos P.","year":"2007","unstructured":"P. Zikopoulos . G. Baklarz , L. Katsnelson . and C. Eaton . IBM DB2 9 New Features . McGraw-Hill , 2007 . P. Zikopoulos. G. Baklarz, L. Katsnelson. and C. Eaton. IBM DB2 9 New Features. McGraw-Hill, 2007."},{"key":"e_1_2_1_13_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.1453925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:12:14Z","timestamp":1672225934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453925"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453925","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}