{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:15:28Z","timestamp":1772122528810,"version":"3.50.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>The accuracy of cardinality estimates is crucial for obtaining a good query execution plan. Today's optimizers make several simplifying assumptions during cardinality estimation that can lead to large errors and hence poor plans. In a scenario such as query optimizer testing it is very desirable to obtain the \"best\" plan, i.e., the plan produced when the cardinality of each relevant expression is exact. Such a plan serves as a baseline against which plans produced by using the existing cardinality estimation module in the query optimizer can be compared. However, obtaining all exact cardinalities by executing appropriate subexpressions can be prohibitively expensive. In this paper, we present a set of techniques that makes exact cardinality query optimization a viable option for a significantly larger set of queries than previously possible. We have implemented this functionality in Microsoft SQL Server and we present results using the TPC-H benchmark queries that demonstrate their effectiveness.<\/jats:p>","DOI":"10.14778\/1687627.1687739","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"994-1005","source":"Crossref","is-referenced-by-count":20,"title":["Exact cardinality query optimization for optimizer testing"],"prefix":"10.14778","volume":"2","author":[{"given":"Surajit","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"Vivek","family":"Narasayya","sequence":"additional","affiliation":[]},{"given":"Ravi","family":"Ramamurthy","sequence":"additional","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316788"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of VLDB","author":"Agrawal S.","year":"2000"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50097-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564722"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908978"},{"key":"e_1_2_1_6_1","unstructured":"S. Chaudhuri V. Narasayya. Program for TPC-D Data Generation with skew. ftp:\/\/ftp.research.microsoft.com\/users\/viveknar\/tpcdskew  S. Chaudhuri V. Narasayya. Program for TPC-D Data Generation with skew . ftp:\/\/ftp.research.microsoft.com\/users\/viveknar\/tpcdskew"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191874"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00031-X"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000001"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367897"},{"key":"e_1_2_1_11_1","volume-title":"Freeman and Company","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_12_1","unstructured":"G. Graefe. The Cascades framework for query optimization. Data Engineering Bulletin 18(3) 1995.  G. Graefe. The Cascades framework for query optimization . Data Engineering Bulletin 18(3) 1995."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315455"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276315"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.93611"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007642"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335419"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_2_1_20_1","volume-title":"Learning Optimizer. In Proceedings of VLDB","author":"Stillger M.","year":"2001"},{"key":"e_1_2_1_21_1","unstructured":"V. Vazirani. Approximation Algorithms. Springer-Verlag 2001.   V. Vazirani. Approximation Algorithms . Springer-Verlag 2001."},{"key":"e_1_2_1_22_1","unstructured":"TPC Benchmark H. Decision Support. http:\/\/www.tpc.org TPC Benchmark H. Decision Support . http:\/\/www.tpc.org"},{"key":"e_1_2_1_23_1","unstructured":"Y. Kotidis Y. Sismanis N. Roussopoulos. Shared Index Scans for Data Warehouses.  Y. Kotidis Y. Sismanis N. Roussopoulos. Shared Index Scans for Data Warehouses."},{"key":"e_1_2_1_24_1","volume-title":"Design Advisor: Integrated Automatic Physical Database Design. In Proceedings of VLDB","author":"Zilio D.","year":"2004"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:34:22Z","timestamp":1672227262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687739"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687739","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}