{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T19:29:59Z","timestamp":1751398199481,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. National Science Foundation","award":["IIS-1908984","IIS-1850342"],"award-info":[{"award-number":["IIS-1908984","IIS-1850342"]}]},{"name":"ONR Award","award":["AWD-101549-S1"],"award-info":[{"award-number":["AWD-101549-S1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457262","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"2169-2181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["SIA"],"prefix":"10.1145","author":[{"given":"Qi","family":"Zhou","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Joy","family":"Arulraj","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Shamkant","family":"Navathe","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"William","family":"Harris","sequence":"additional","affiliation":[{"name":"Galois Inc, Portland, OR, USA"}]},{"given":"Jinpeng","family":"Wu","sequence":"additional","affiliation":[{"name":"Alibaba Group, HangZhou, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n.d.]. Alibaba MaxCompute. https:\/\/www.alibabacloud.com\/product\/maxcompute.  [n.d.]. Alibaba MaxCompute. https:\/\/www.alibabacloud.com\/product\/maxcompute."},{"key":"e_1_3_2_2_2_1","unstructured":"[n.d.]. Apache Calcite Project. http:\/\/calcite.apache.org\/.  [n.d.]. Apache Calcite Project. http:\/\/calcite.apache.org\/."},{"key":"e_1_3_2_2_3_1","unstructured":"[n.d.]. LibSVM. https:\/\/github.com\/cjlin1\/libsvm.  [n.d.]. LibSVM. https:\/\/github.com\/cjlin1\/libsvm."},{"key":"e_1_3_2_2_4_1","unstructured":"[n.d.]. PostgreSQL. https:\/\/www.postgresql.org\/.  [n.d.]. PostgreSQL. https:\/\/www.postgresql.org\/."},{"key":"e_1_3_2_2_5_1","unstructured":"[n.d.]. Z3Prover: Z3 Theorem Prover. https:\/\/github.com\/Z3Prover\/z3.  [n.d.]. Z3Prover: Z3 Theorem Prover. https:\/\/github.com\/Z3Prover\/z3."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Shadi Abdul Khalek Bassem Elkarablieh Yai O. Laleye and Sarfraz Khurshid. 2008. Query-Aware Test Generation Using a Relational Constraint Solver. In ASE.  Shadi Abdul Khalek Bassem Elkarablieh Yai O. Laleye and Sarfraz Khurshid. 2008. Query-Aware Test Generation Using a Relational Constraint Solver. In ASE.","DOI":"10.1109\/ASE.2008.34"},{"key":"e_1_3_2_2_7_1","volume-title":"Whale: An Interpolation-Based Algorithm for Inter-procedural Verification. In VMCAI.","author":"Albarghouthi Aws","year":"2012","unstructured":"Aws Albarghouthi , Arie Gurfinkel , and Marsha Chechik . 2012 . Whale: An Interpolation-Based Algorithm for Inter-procedural Verification. In VMCAI. Aws Albarghouthi, Arie Gurfinkel, and Marsha Chechik. 2012. Whale: An Interpolation-Based Algorithm for Inter-procedural Verification. In VMCAI."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Nikolaj Bj\u00f8rner Ken McMillan and Andrey Rybalchenko. 2013. On Solving Universally Quantified Horn Clauses.  Nikolaj Bj\u00f8rner Ken McMillan and Andrey Rybalchenko. 2013. On Solving Universally Quantified Horn Clauses.","DOI":"10.1007\/978-3-642-38856-9_8"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Adrien Champion Tomoya Chiba Naoki Kobayashi and Ryosuke Sato. 2018. ICE-Based Refinement Type Discovery for Higher-Order Functional Programs.  Adrien Champion Tomoya Chiba Naoki Kobayashi and Ryosuke Sato. 2018. ICE-Based Refinement Type Discovery for Higher-Order Functional Programs.","DOI":"10.1007\/978-3-319-89960-2_20"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Alvin Cheung Armando Solar-Lezama and Samuel Madden. 2012. Using Program Synthesis for Social Recommendations. In CIKM. 1732--1736.  Alvin Cheung Armando Solar-Lezama and Samuel Madden. 2012. Using Program Synthesis for Social Recommendations. In CIKM. 1732--1736.","DOI":"10.1145\/2396761.2398507"},{"key":"e_1_3_2_2_12_1","volume-title":"Cosette: An Automated SQL Prover.. In CIDR.","author":"Chu Shumo","year":"2017","unstructured":"Shumo Chu , Chenglong Wang , Konstantin Weitz , and Alvin Cheung . 2017 . Cosette: An Automated SQL Prover.. In CIDR. Shumo Chu, Chenglong Wang, Konstantin Weitz, and Alvin Cheung. 2017. Cosette: An Automated SQL Prover.. In CIDR."},{"key":"e_1_3_2_2_13_1","volume-title":"Wood","author":"Consens Mariano P.","year":"1995","unstructured":"Mariano P. Consens , Alberto O. Mendelzon , Dimitra Vista , and Peter T . Wood . 1995 . Constant Propagation Versus Join Reordering in Datalog. In RIDS. Mariano P. Consens, Alberto O. Mendelzon, Dimitra Vista, and Peter T. Wood. 1995. Constant Propagation Versus Join Reordering in Datalog. In RIDS."},{"key":"e_1_3_2_2_14_1","unstructured":"Dennis W. Cooper. 1972. Theorem proving in arithmetic without multiplication. In Machine Intelligence.  Dennis W. Cooper. 1972. Theorem proving in arithmetic without multiplication. In Machine Intelligence."},{"key":"e_1_3_2_2_15_1","volume-title":"Loveland","author":"Davis Martin","year":"1962","unstructured":"Martin Davis , George Logemann , and Donald W . Loveland . 1962 . A machine program for theorem-proving. Commun. ACM ( 1962). Martin Davis, George Logemann, and Donald W. Loveland. 1962. A machine program for theorem-proving. Commun. ACM (1962)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS.  Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Isil Dillig Thomas Dillig Kenneth L. McMillan and Alex Aiken. 2012. Minimum Satisfying Assignments for SMT. In CAV.  Isil Dillig Thomas Dillig Kenneth L. McMillan and Alex Aiken. 2012. Minimum Satisfying Assignments for SMT. In CAV.","DOI":"10.1007\/978-3-642-31424-7_30"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Bruno Dutertre. 2014. Yices 2.2. In CAV.  Bruno Dutertre. 2014. Yices 2.2. In CAV.","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"e_1_3_2_2_19_1","volume-title":"Joshi","author":"Elhemali Mostafa","year":"2007","unstructured":"Mostafa Elhemali , C\u00e9sar A. Galindo-legaria, Torsten Grabs , and Milind M . Joshi . 2007 . Execution Strategies for SQL Subqueries. In SIGMOD. Mostafa Elhemali, C\u00e9sar A. Galindo-legaria, Torsten Grabs, and Milind M. Joshi. 2007. Execution Strategies for SQL Subqueries. In SIGMOD."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Pranav Garg Daniel Neider P. Madhusudan and Dan Roth. 2016. Learning Invariants Using Decision Trees and Implication Counterexamples. In POPL.  Pranav Garg Daniel Neider P. Madhusudan and Dan Roth. 2016. Learning Invariants Using Decision Trees and Implication Counterexamples. In POPL.","DOI":"10.1145\/2837614.2837664"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Sergey Grebenshchikov Nuno Lopes Corneliu Popeea and Andrey Rybalchenko. 2012. Synthesizing Software Verifiers from Proof Rules. (2012).  Sergey Grebenshchikov Nuno Lopes Corneliu Popeea and Andrey Rybalchenko. 2012. Synthesizing Software Verifiers from Proof Rules. (2012).","DOI":"10.1145\/2254064.2254112"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Matthias Heizmann Jochen Hoenicke and Andreas Podelski. 2010. Nested Interpolants. In POPL.  Matthias Heizmann Jochen Hoenicke and Andreas Podelski. 2010. Nested Interpolants. In POPL.","DOI":"10.1145\/1706299.1706353"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Ihab F. Ilyas V. Markl P. Haas P. Brown and A. Aboulnaga. 2004. CORDS: automatic discovery of correlations and soft functional dependencies. In SIGMOD.  Ihab F. Ilyas V. Markl P. Haas P. Brown and A. Aboulnaga. 2004. CORDS: automatic discovery of correlations and soft functional dependencies. In SIGMOD.","DOI":"10.1145\/1007568.1007641"},{"key":"e_1_3_2_2_24_1","unstructured":"Yannis Ioannidis and Raghu Ramakrishnan. 1988. Efficient Transitive Closure Algorithms.. In VLDB.  Yannis Ioannidis and Raghu Ramakrishnan. 1988. Efficient Transitive Closure Algorithms.. In VLDB."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Manas Joglekar Hector Garcia-Molina Aditya Parameswaran and Christopher Re. 2015. Exploiting Correlations for Expensive Predicate Evaluation. In SIGMOD.  Manas Joglekar Hector Garcia-Molina Aditya Parameswaran and Christopher Re. 2015. Exploiting Correlations for Expensive Predicate Evaluation. In SIGMOD.","DOI":"10.1145\/2723372.2723715"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Srikanth Kandula Laurel Orr and Surajit Chaudhuri. 2019. Pushing Data-Induced Predicates through Joins in Big-Data Clusters. (2019).  Srikanth Kandula Laurel Orr and Surajit Chaudhuri. 2019. Pushing Data-Induced Predicates through Joins in Big-Data Clusters. (2019).","DOI":"10.14778\/3368289.3368292"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687765"},{"key":"e_1_3_2_2_28_1","volume-title":"Inderpal Singh Mumick, and Yehoshua Sagiv","author":"Levy Alon Y.","year":"1994","unstructured":"Alon Y. Levy , Inderpal Singh Mumick, and Yehoshua Sagiv . 1994 . Query Optimization by Predicate Move-Around. In VLDB. Alon Y. Levy, Inderpal Singh Mumick, and Yehoshua Sagiv. 1994. Query Optimization by Predicate Move-Around. In VLDB."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Yao Lu Aakanksha Chowdhery Srikanth Kandula and Surajit Chaudhuri. 2018. Accelerating Machine Learning Inference with Probabilistic Predicates. In SIGMOD.  Yao Lu Aakanksha Chowdhery Srikanth Kandula and Surajit Chaudhuri. 2018. Accelerating Machine Learning Inference with Probabilistic Predicates. In SIGMOD.","DOI":"10.1145\/3183713.3183751"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Yuri V. Matiyasevich. 2005. Hilbert's Tenth Problem and Paradigms of Computation. In CiE.  Yuri V. Matiyasevich. 2005. Hilbert's Tenth Problem and Paradigms of Computation. In CiE.","DOI":"10.1007\/11494645_39"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Kenneth L. McMillan. 2006. Lazy Abstraction with Interpolants. In CAV.  Kenneth L. McMillan. 2006. Lazy Abstraction with Interpolants. In CAV.","DOI":"10.1007\/11817963_14"},{"key":"e_1_3_2_2_32_1","volume-title":"Oppen","author":"Nelson Greg","year":"1979","unstructured":"Greg Nelson and Derek C . Oppen . 1979 . Simplification by Cooperating Decision Procedures. ACM Trans. Program. Lang. Syst . (1979). Greg Nelson and Derek C. Oppen. 1979. Simplification by Cooperating Decision Procedures. ACM Trans. Program. Lang. Syst. (1979)."},{"key":"e_1_3_2_2_33_1","unstructured":"Massimo Pezzini Donald Feinberg Nigel Rayner and Roxane Edjlali. 2014. Hybrid Transaction\/Analytical Processing Will Foster Opportunities for Dramatic Business Innovation. https:\/\/www.gartner.com\/doc\/2657815\/.  Massimo Pezzini Donald Feinberg Nigel Rayner and Roxane Edjlali. 2014. Hybrid Transaction\/Analytical Processing Will Foster Opportunities for Dramatic Business Innovation. https:\/\/www.gartner.com\/doc\/2657815\/."},{"key":"e_1_3_2_2_34_1","unstructured":"John C Platt. 1999. Advances in Kernel Methods. (1999).  John C Platt. 1999. Advances in Kernel Methods. (1999)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Philipp R\u00fcmmer Hossein Hojjat and Viktor Kuncak. 2013. Disjunctive Interpolants for Horn-Clause Verification. In CAV.  Philipp R\u00fcmmer Hossein Hojjat and Viktor Kuncak. 2013. Disjunctive Interpolants for Horn-Clause Verification. In CAV.","DOI":"10.1007\/978-3-642-39799-8_24"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Sriram Sankaranarayanan Swarat Chaudhuri Franjo Ivancic and Aarti Gupta. 2008. Dynamic inference of likely data preconditions over predicates by tree learning. In ISSTA.  Sriram Sankaranarayanan Swarat Chaudhuri Franjo Ivancic and Aarti Gupta. 2008. Dynamic inference of likely data preconditions over predicates by tree learning. In ISSTA.","DOI":"10.1145\/1390630.1390666"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Praveen Seshadri Joseph M. Hellerstein Hamid Pirahesh T. Y. Cliff Leung Raghu Ramakrishnan Divesh Srivastava Peter J. Stuckey and S. Sudarshan. 1996. Cost- Based Optimization for Magic: Algebra and Implementation. In SIGMOD.  Praveen Seshadri Joseph M. Hellerstein Hamid Pirahesh T. Y. Cliff Leung Raghu Ramakrishnan Divesh Srivastava Peter J. Stuckey and S. Sudarshan. 1996. Cost- Based Optimization for Magic: Algebra and Implementation. In SIGMOD.","DOI":"10.1145\/233269.233360"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Rahul Sharma Saurabh Gupta Bharath Hariharan Alex Aiken and Aditya Nori. 2013. Verification as Learning Geometric Concepts. In SAS.  Rahul Sharma Saurabh Gupta Bharath Hariharan Alex Aiken and Aditya Nori. 2013. Verification as Learning Geometric Concepts. In SAS.","DOI":"10.1007\/978-3-642-38856-9_21"},{"key":"e_1_3_2_2_39_1","unstructured":"Narayanan Shivakumar Hector Garcia-Molina and Chandra Chekuri. 1998. Filtering with Approximate Predicates. In VLDB.  Narayanan Shivakumar Hector Garcia-Molina and Chandra Chekuri. 1998. Filtering with Approximate Predicates. In VLDB."},{"key":"e_1_3_2_2_40_1","volume-title":"Thomas Peh, and Christof Bornh\u00f6vd.","author":"Sikka Vishal","year":"2012","unstructured":"Vishal Sikka , Franz F\u00e4rber , Wolfgang Lehner , Sang Kyun Cha , Thomas Peh, and Christof Bornh\u00f6vd. 2012 . Efficient Transaction Processing in SAP HANA Database: The End of a Column Store Myth. In SIGMOD. 731--742. Vishal Sikka, Franz F\u00e4rber, Wolfgang Lehner, Sang Kyun Cha, Thomas Peh, and Christof Bornh\u00f6vd. 2012. Efficient Transaction Processing in SAP HANA Database: The End of a Column Store Myth. In SIGMOD. 731--742."},{"key":"e_1_3_2_2_41_1","unstructured":"Chaudhuri Surajit Narasayya Vivek and Sarawagi Sunita. 2002. Efficient evaluation of queries with mining predicates. In ICDE.  Chaudhuri Surajit Narasayya Vivek and Sarawagi Sunita. 2002. Efficient evaluation of queries with mining predicates. In ICDE."},{"key":"e_1_3_2_2_42_1","unstructured":"J. A. K. Suykens and J. Vandewalle. 1999. Least Squares Support Vector Machine Classifiers. Neural Process. Lett. (1999).  J. A. K. Suykens and J. Vandewalle. 1999. Least Squares Support Vector Machine Classifiers. Neural Process. Lett. (1999)."},{"key":"e_1_3_2_2_43_1","unstructured":"The Transaction Processing Council. 2013. TPC-H Benchmark (Revision 2.16.0). http:\/\/www.tpc.org\/tpch\/.  The Transaction Processing Council. 2013. TPC-H Benchmark (Revision 2.16.0). http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Nga Tran Andrew Lamb Lakshmikant Shrinivas Sreenath Bodagala and Jaimin Dave. 2014. The Vertica Query Optimizer: The case for specialized query optimizers. In ICDE.  Nga Tran Andrew Lamb Lakshmikant Shrinivas Sreenath Bodagala and Jaimin Dave. 2014. The Vertica Query Optimizer: The case for specialized query optimizers. In ICDE.","DOI":"10.1109\/ICDE.2014.6816727"},{"key":"e_1_3_2_2_45_1","unstructured":"Jeffrey ullman. 1989. Principle of database and knowledge-bas systems.  Jeffrey ullman. 1989. Principle of database and knowledge-bas systems."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Margus Veanes Pavel Grigorenko Peli de Halleux and Nikolai Tillmann. 2009. Symbolic Query Exploration. In FormaliSE.  Margus Veanes Pavel Grigorenko Peli de Halleux and Nikolai Tillmann. 2009. Symbolic Query Exploration. In FormaliSE.","DOI":"10.1007\/978-3-642-10373-5_3"},{"key":"e_1_3_2_2_47_1","volume-title":"Qex: Symbolic SQL Query Explorer. In LPAR.","author":"Veanes Margus","year":"2010","unstructured":"Margus Veanes , Nikolai Tillmann , and Jonathan de Halleux . 2010 . Qex: Symbolic SQL Query Explorer. In LPAR. Margus Veanes, Nikolai Tillmann, and Jonathan de Halleux. 2010. Qex: Symbolic SQL Query Explorer. In LPAR."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"BrettWalenz Sudeepa Roy and Jun Yang. 2017. Optimizing Iceberg Queries with Complex Joins. In SIGMOD.  BrettWalenz Sudeepa Roy and Jun Yang. 2017. Optimizing Iceberg Queries with Complex Joins. In SIGMOD.","DOI":"10.1145\/3035918.3064053"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342267"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"He Zhu Stephen Magill and Suresh Jagannathan. 2018. A data-driven CHC solver.  He Zhu Stephen Magill and Suresh Jagannathan. 2018. A data-driven CHC solver.","DOI":"10.1145\/3192366.3192416"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457262"}},"subtitle":["Optimizing Queries using Learned Predicates"],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":50,"alternative-id":["10.1145\/3448016.3457262","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457262","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}