{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:10Z","timestamp":1773481870074,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>Optimization of queries with conjunctive predicates for main memory databases remains a challenging task. The traditional way of optimizing this class of queries relies on predicate ordering based on selectivities or ranks. However, the optimization of queries with conjunctive predicates is a much more challenging task, requiring a holistic approach in view of (1) an accurate cost model that is aware of CPU architectural characteristics such as branch (mis)prediction, (2) a storage layer, allowing for a streamlined query execution, (3) a common subexpression elimination technique, minimizing column access costs, and (4) an optimization algorithm able to pick the optimal plan even in presence of a small (bounded) estimation error. In this work, we embrace the holistic approach, and show its superiority experimentally.<\/jats:p>\n          <jats:p>Current approaches typically base their optimization algorithms on at least one of two assumptions: (1) the predicate selectivities are assumed to be independent, (2) the predicate costs are assumed to be constant. Our approach is not based on these assumptions, as they in general do not hold.<\/jats:p>","DOI":"10.14778\/2994509.2994529","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T15:27:03Z","timestamp":1473175623000},"page":"1125-1136","source":"Crossref","is-referenced-by-count":14,"title":["Optimization of conjunctive predicates for main memory column stores"],"prefix":"10.14778","volume":"9","author":[{"given":"Fisnik","family":"Kastrati","sequence":"first","affiliation":[{"name":"University of Mannheim, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[{"name":"University of Mannheim, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367892"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170080"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335230"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/329.318578"},{"key":"e_1_2_1_5_1","unstructured":"College of Natural Resources Colorado State University. Forest dataset. http:\/\/kdd.ics.uci.edu\/databases\/covertype\/covertype.data.html.  College of Natural Resources Colorado State University. Forest dataset. http:\/\/kdd.ics.uci.edu\/databases\/covertype\/covertype.data.html."},{"key":"e_1_2_1_6_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , C. Stein , Introduction to algorithms . MIT press Cambridge , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, et al. Introduction to algorithms. MIT press Cambridge, 2001."},{"key":"e_1_2_1_7_1","volume-title":"Histograms, Wavelets, Sketches","author":"Cormode G.","year":"2012","unstructured":"G. Cormode , M. Garofalakis , P. Haas , and C. Jermaine . Synopses for Massive Data: Samples , Histograms, Wavelets, Sketches . NOW Press , 2012 . G. Cormode, M. Garofalakis, P. Haas, and C. Jermaine. Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches. NOW Press, 2012."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_9_1","first-page":"541","volume-title":"VLDB","author":"Gibbons P.","year":"2001","unstructured":"P. Gibbons . Distinct sampling for highly-accurate answers to distinct values queries and event reports . In VLDB , pages 541 -- 550 , 2001 . P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, pages 541--550, 2001."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921077"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170078"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1270.1498"},{"key":"e_1_2_1_13_1","unstructured":"IBM. Soliddb. http:\/\/www.ibm.com\/software\/data\/soliddb.  IBM. Soliddb. http:\/\/www.ibm.com\/software\/data\/soliddb."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453925"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807239"},{"key":"e_1_2_1_17_1","first-page":"290","volume-title":"VLDB","author":"Kemper A.","year":"1990","unstructured":"A. Kemper and G. Moerkotte . Advanced query processing in object bases using access support relations . In VLDB , pages 290 -- 301 , 1990 . A. Kemper and G. Moerkotte. Advanced query processing in object bases using access support relations. In VLDB, pages 290--301, 1990."},{"key":"e_1_2_1_18_1","first-page":"79","volume-title":"VLDB","author":"Kemper A.","year":"1992","unstructured":"A. Kemper , G. Moerkotte , and M. Steinbrunn . Optimizing boolean expressions in object bases . In VLDB , pages 79 -- 90 , 1992 . A. Kemper, G. Moerkotte, and M. Steinbrunn. Optimizing boolean expressions in object bases. In VLDB, pages 79--90, 1992."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_2_1_20_1","first-page":"128","volume-title":"VLDB","author":"Krishnamurthy R.","year":"1986","unstructured":"R. Krishnamurthy , H. Boral , and C. Zaniolo . Optimization of nonrecursive queries . In VLDB , pages 128 -- 137 , 1986 . R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of nonrecursive queries. In VLDB, pages 128--137, 1986."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0030-1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.421.0098"},{"key":"e_1_2_1_24_1","first-page":"i3","author":"Moerkotte G.","year":"2014","unstructured":"G. Moerkotte . Building Query Compiler. 2014 . p i3 .informatik.uni-mannheim.de\/~moer\/querycompiler.pdf. G. Moerkotte. Building Query Compiler. 2014. pi3.informatik.uni-mannheim.de\/~moer\/querycompiler.pdf.","journal-title":"Building Query Compiler."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2015.02.030"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_6"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002940"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.97"},{"key":"e_1_2_1_30_1","unstructured":"Oracle. TimesTen In-Memory Database. http:\/\/www.oracle.com\/technetwork\/database\/database-technologies\/timesten\/overview\/index.html.  Oracle. TimesTen In-Memory Database. http:\/\/www.oracle.com\/technetwork\/database\/database-technologies\/timesten\/overview\/index.html."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543628"},{"key":"e_1_2_1_32_1","unstructured":"SAP. In-Memory Computing (SAP HANA). http:\/\/www.sap.com\/pc\/tech\/in-memory-computing-hana\/software\/overview\/index.html.  SAP. In-Memory Computing (SAP HANA). http:\/\/www.sap.com\/pc\/tech\/in-memory-computing-hana\/software\/overview\/index.html."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2009.08.009"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995441.1995446"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0293-7"},{"key":"e_1_2_1_36_1","unstructured":"VoltDB. In-memory database. http:\/\/www.voltdb.com.  VoltDB. In-memory database. http:\/\/www.voltdb.com."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.148"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2994509.2994529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:53:55Z","timestamp":1672224835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2994509.2994529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.14778\/2994509.2994529"],"URL":"https:\/\/doi.org\/10.14778\/2994509.2994529","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}